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;
  }
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz