import java.util.Scanner;
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 = selectionSort(a,n);
    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 static int selectionSort(int[] a, int n){
    int count = 0;
    for(int i = 0; i<n; i++){
      int minj = i;
      for(int j = i; j<n; j++){
        if(a[j]<a[minj]){
          minj = j;
        }
      }
      int free = a[i];
      a[i] = a[minj];
      a[minj] = free;
      if(a[i] != a[minj]){
        count++;
      }
    }
    return count;
  }
} import java.util.Scanner; Scanner 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 = selectionSort(a,n);
    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 static int selectionSort(int[] a, int n){
    int count = 0;
    for(int i = 0; i<n; i++){
      int minj = i;
      for(int j = i; j<n; j++){
        if(a[j]<a[minj]){
          minj = j;
        }
      }
      int free = a[i];
      a[i] = a[minj];
      a[minj] = free;
      if(a[i] != a[minj]){
        count++;
      }
    }
    return 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 = selectionSort(a,n);
    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 = selectionSort(a,n);
    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 = selectionSort(a,n); count selectionSort(a,n) selectionSort a n 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 static int selectionSort(int[] a, int n){
    int count = 0;
    for(int i = 0; i<n; i++){
      int minj = i;
      for(int j = i; j<n; j++){
        if(a[j]<a[minj]){
          minj = j;
        }
      }
      int free = a[i];
      a[i] = a[minj];
      a[minj] = free;
      if(a[i] != a[minj]){
        count++;
      }
    }
    return count;
  } selectionSort {
    int count = 0;
    for(int i = 0; i<n; i++){
      int minj = i;
      for(int j = i; j<n; j++){
        if(a[j]<a[minj]){
          minj = j;
        }
      }
      int free = a[i];
      a[i] = a[minj];
      a[minj] = free;
      if(a[i] != a[minj]){
        count++;
      }
    }
    return count;
  } int count = 0; count 0 for(int i = 0; i<n; i++){
      int minj = i;
      for(int j = i; j<n; j++){
        if(a[j]<a[minj]){
          minj = j;
        }
      }
      int free = a[i];
      a[i] = a[minj];
      a[minj] = free;
      if(a[i] != a[minj]){
        count++;
      }
    } int i = 0; int i = 0; i 0 i<n i n i++ i++ i {
      int minj = i;
      for(int j = i; j<n; j++){
        if(a[j]<a[minj]){
          minj = j;
        }
      }
      int free = a[i];
      a[i] = a[minj];
      a[minj] = free;
      if(a[i] != a[minj]){
        count++;
      }
    } {
      int minj = i;
      for(int j = i; j<n; j++){
        if(a[j]<a[minj]){
          minj = j;
        }
      }
      int free = a[i];
      a[i] = a[minj];
      a[minj] = free;
      if(a[i] != a[minj]){
        count++;
      }
    } int minj = i; minj i for(int j = i; j<n; j++){
        if(a[j]<a[minj]){
          minj = j;
        }
      } int j = i; int j = i; j i j<n j n j++ j++ j {
        if(a[j]<a[minj]){
          minj = j;
        }
      } {
        if(a[j]<a[minj]){
          minj = j;
        }
      } if(a[j]<a[minj]){
          minj = j;
        } a[j]<a[minj] a[j] a j a[minj] a minj {
          minj = j;
        } minj = j minj j int free = a[i]; free a[i] a i a[i] = a[minj] a[i] a i a[minj] a minj a[minj] = free a[minj] a minj free if(a[i] != a[minj]){
        count++;
      } a[i] != a[minj] a[i] a i a[minj] a minj {
        count++;
      } count++ count return count; count int[] a a int n n 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 = selectionSort(a,n);
    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 static int selectionSort(int[] a, int n){
    int count = 0;
    for(int i = 0; i<n; i++){
      int minj = i;
      for(int j = i; j<n; j++){
        if(a[j]<a[minj]){
          minj = j;
        }
      }
      int free = a[i];
      a[i] = a[minj];
      a[minj] = free;
      if(a[i] != a[minj]){
        count++;
      }
    }
    return 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 = selectionSort(a,n);
    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 static int selectionSort(int[] a, int n){
    int count = 0;
    for(int i = 0; i<n; i++){
      int minj = i;
      for(int j = i; j<n; j++){
        if(a[j]<a[minj]){
          minj = j;
        }
      }
      int free = a[i];
      a[i] = a[minj];
      a[minj] = free;
      if(a[i] != a[minj]){
        count++;
      }
    }
    return count;
  }
} Main
import java.util.Scanner;
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 = selectionSort(a,n);
    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 static int selectionSort(int[] a, int n){
    int count = 0;
    for(int i = 0; i<n; i++){
      int minj = i;
      for(int j = i; j<n; j++){
        if(a[j]<a[minj]){
          minj = j;
        }
      }
      int free = a[i];
      a[i] = a[minj];
      a[minj] = free;
      if(a[i] != a[minj]){
        count++;
      }
    }
    return count;
  }
}