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];
		int i, j, k, t, min;
		int l = 0, count = 0;
		
		for(i = 0;i < N; i++) {
			A[i] = sc.nextInt();
		}
		
		for(j = 0;j < A.length; j++) {
			min = A[j];
			for(k = j; k < A.length-1; k++) {
				if(min > A[k+1]) {
					min = A[k+1];
					l = k+1;
				}
			}
			if(A[j] != min) {
				A[l] = A[j];
				A[j] = min;
				count++;
			}
		}
		
		for (l = 0;l < N - 1; l++) {
			System.out.print(A[l] + " ");
		}
		System.out.println(A[N-1]);
		System.out.println(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