import java.util.*;

public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int[] a = new int[n];
    for(int i = 0; i < n; i++) {
      a[i] = sc.nextInt();
    }
    int count = 0;
    for(int i = 0; i < n - 1; i++) {
      boolean sort = false;
      int min = a[i];
      int key = i;
      for(int j = i; j < n; j++) {
        if(min > a[j]) {
          min = a[j];
          key = j;
          sort = true;
        }
      }
      if(sort) {
        a[key] = a[i];
        a[i] = min;
        count++;
      }
    }
    for(int i = 0; i < n; i++) {
      if(i == n- 1) {
        System.out.println(a[i]);
      } else {
        System.out.print(a[i] + " ");
      }
    }
    System.out.println(count);
  }
}
 import java.util.*; util.* java public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int[] a = new int[n];
    for(int i = 0; i < n; i++) {
      a[i] = sc.nextInt();
    }
    int count = 0;
    for(int i = 0; i < n - 1; i++) {
      boolean sort = false;
      int min = a[i];
      int key = i;
      for(int j = i; j < n; j++) {
        if(min > a[j]) {
          min = a[j];
          key = j;
          sort = true;
        }
      }
      if(sort) {
        a[key] = a[i];
        a[i] = min;
        count++;
      }
    }
    for(int i = 0; i < n; i++) {
      if(i == n- 1) {
        System.out.println(a[i]);
      } else {
        System.out.print(a[i] + " ");
      }
    }
    System.out.println(count);
  }
} Main public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int[] a = new int[n];
    for(int i = 0; i < n; i++) {
      a[i] = sc.nextInt();
    }
    int count = 0;
    for(int i = 0; i < n - 1; i++) {
      boolean sort = false;
      int min = a[i];
      int key = i;
      for(int j = i; j < n; j++) {
        if(min > a[j]) {
          min = a[j];
          key = j;
          sort = true;
        }
      }
      if(sort) {
        a[key] = a[i];
        a[i] = min;
        count++;
      }
    }
    for(int i = 0; i < n; i++) {
      if(i == n- 1) {
        System.out.println(a[i]);
      } else {
        System.out.print(a[i] + " ");
      }
    }
    System.out.println(count);
  } main {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int[] a = new int[n];
    for(int i = 0; i < n; i++) {
      a[i] = sc.nextInt();
    }
    int count = 0;
    for(int i = 0; i < n - 1; i++) {
      boolean sort = false;
      int min = a[i];
      int key = i;
      for(int j = i; j < n; j++) {
        if(min > a[j]) {
          min = a[j];
          key = j;
          sort = true;
        }
      }
      if(sort) {
        a[key] = a[i];
        a[i] = min;
        count++;
      }
    }
    for(int i = 0; i < n; i++) {
      if(i == n- 1) {
        System.out.println(a[i]);
      } else {
        System.out.print(a[i] + " ");
      }
    }
    System.out.println(count);
  } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n = sc.nextInt(); n sc.nextInt() sc.nextInt sc int[] a = new int[n]; a new int[n] n for(int i = 0; i < n; i++) {
      a[i] = sc.nextInt();
    } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
      a[i] = sc.nextInt();
    } {
      a[i] = sc.nextInt();
    } a[i] = sc.nextInt() a[i] a i sc.nextInt() sc.nextInt sc int count = 0; count 0 for(int i = 0; i < n - 1; i++) {
      boolean sort = false;
      int min = a[i];
      int key = i;
      for(int j = i; j < n; j++) {
        if(min > a[j]) {
          min = a[j];
          key = j;
          sort = true;
        }
      }
      if(sort) {
        a[key] = a[i];
        a[i] = min;
        count++;
      }
    } int i = 0; int i = 0; i 0 i < n - 1 i n - 1 n 1 i++ i++ i {
      boolean sort = false;
      int min = a[i];
      int key = i;
      for(int j = i; j < n; j++) {
        if(min > a[j]) {
          min = a[j];
          key = j;
          sort = true;
        }
      }
      if(sort) {
        a[key] = a[i];
        a[i] = min;
        count++;
      }
    } {
      boolean sort = false;
      int min = a[i];
      int key = i;
      for(int j = i; j < n; j++) {
        if(min > a[j]) {
          min = a[j];
          key = j;
          sort = true;
        }
      }
      if(sort) {
        a[key] = a[i];
        a[i] = min;
        count++;
      }
    } boolean sort = false; sort false int min = a[i]; min a[i] a i int key = i; key i for(int j = i; j < n; j++) {
        if(min > a[j]) {
          min = a[j];
          key = j;
          sort = true;
        }
      } int j = i; int j = i; j i j < n j n j++ j++ j {
        if(min > a[j]) {
          min = a[j];
          key = j;
          sort = true;
        }
      } {
        if(min > a[j]) {
          min = a[j];
          key = j;
          sort = true;
        }
      } if(min > a[j]) {
          min = a[j];
          key = j;
          sort = true;
        } min > a[j] min a[j] a j {
          min = a[j];
          key = j;
          sort = true;
        } min = a[j] min a[j] a j key = j key j sort = true sort true if(sort) {
        a[key] = a[i];
        a[i] = min;
        count++;
      } sort {
        a[key] = a[i];
        a[i] = min;
        count++;
      } a[key] = a[i] a[key] a key a[i] a i a[i] = min a[i] a i min count++ count for(int i = 0; i < n; i++) {
      if(i == n- 1) {
        System.out.println(a[i]);
      } else {
        System.out.print(a[i] + " ");
      }
    } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
      if(i == n- 1) {
        System.out.println(a[i]);
      } else {
        System.out.print(a[i] + " ");
      }
    } {
      if(i == n- 1) {
        System.out.println(a[i]);
      } else {
        System.out.print(a[i] + " ");
      }
    } if(i == n- 1) {
        System.out.println(a[i]);
      } else {
        System.out.print(a[i] + " ");
      } i == n- 1 i n- 1 n 1 {
        System.out.println(a[i]);
      } System.out.println(a[i]) System.out.println System.out System System.out a[i] a i {
        System.out.print(a[i] + " ");
      } System.out.print(a[i] + " ") System.out.print System.out System System.out a[i] + " " a[i] a i " " System.out.println(count) System.out.println System.out System System.out count String[] args args public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int[] a = new int[n];
    for(int i = 0; i < n; i++) {
      a[i] = sc.nextInt();
    }
    int count = 0;
    for(int i = 0; i < n - 1; i++) {
      boolean sort = false;
      int min = a[i];
      int key = i;
      for(int j = i; j < n; j++) {
        if(min > a[j]) {
          min = a[j];
          key = j;
          sort = true;
        }
      }
      if(sort) {
        a[key] = a[i];
        a[i] = min;
        count++;
      }
    }
    for(int i = 0; i < n; i++) {
      if(i == n- 1) {
        System.out.println(a[i]);
      } else {
        System.out.print(a[i] + " ");
      }
    }
    System.out.println(count);
  }
} public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int[] a = new int[n];
    for(int i = 0; i < n; i++) {
      a[i] = sc.nextInt();
    }
    int count = 0;
    for(int i = 0; i < n - 1; i++) {
      boolean sort = false;
      int min = a[i];
      int key = i;
      for(int j = i; j < n; j++) {
        if(min > a[j]) {
          min = a[j];
          key = j;
          sort = true;
        }
      }
      if(sort) {
        a[key] = a[i];
        a[i] = min;
        count++;
      }
    }
    for(int i = 0; i < n; i++) {
      if(i == n- 1) {
        System.out.println(a[i]);
      } else {
        System.out.print(a[i] + " ");
      }
    }
    System.out.println(count);
  }
} Main
import java.util.*;

public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int[] a = new int[n];
    for(int i = 0; i < n; i++) {
      a[i] = sc.nextInt();
    }
    int count = 0;
    for(int i = 0; i < n - 1; i++) {
      boolean sort = false;
      int min = a[i];
      int key = i;
      for(int j = i; j < n; j++) {
        if(min > a[j]) {
          min = a[j];
          key = j;
          sort = true;
        }
      }
      if(sort) {
        a[key] = a[i];
        a[i] = min;
        count++;
      }
    }
    for(int i = 0; i < n; i++) {
      if(i == n- 1) {
        System.out.println(a[i]);
      } else {
        System.out.print(a[i] + " ");
      }
    }
    System.out.println(count);
  }
}

