import java.util.Scanner;

public class Main{
    Main(){
    Scanner sc = new Scanner(System.in);
    int n, t, s, cnt;
    int[] a;
 
    while(sc.hasNext()){
        n = sc.nextInt();
 
        a = new int[n];
        for(int i = 0; i < n; ++i)
        a[i] = sc.nextInt();
 
        cnt = 0;
        for(int i = 0; i < n; ++i){
        t = i;
        for(int j = i; j < n; ++j)
            if(a[j] < a[t]) t = j;
 
        if(a[t] != a[i]){
            s = a[i];
            a[i] = a[t];
            a[t] = s;
            ++cnt;
        }
        }
 
        for(int i = 0; i < n-1; ++i)
        System.out.printf("%d ", a[i]);
        System.out.println(a[n-1]);
        System.out.println(cnt);
    }
    }
 
    public static void main(String[] args){
    new Main();
    }
}

/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