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();
		}
		selectionSort(a, n);
	}

	static void selectionSort(int[] a, int n) {
		int cnt = 0;
		for(int i = 0 ; i < n ; i++) {
			int minj = i;
			for(int j = i ; j < n ; j++) {
				if(a[minj] > a[j]) {
					minj = j;
				}
			}
			if(a[minj] < a[i]) {
				int v = a[i];
				a[i] = a[minj];
				a[minj] = v;
				cnt++;
			}
		}
		for(int i = 0 ; i < n ; i++) {
			if(i != n - 1) {
				System.out.print(a[i] + " ");
			} else {
				System.out.println(a[i]);
			}
		}
		System.out.println(cnt);
	}

}
/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