import java.util.Scanner;

public class Main{
	public static void main(String args[]) {
		int i, j;// loop counter
		int N/* number of element */, num[]/* array of number */, min/* order number of minimum number */;
		int count = 0;// count number of exchanging number
		Scanner sc = new Scanner(System.in);
		N = sc.nextInt();
		num = new int[N];
		for (i = 0; i < N; ++i) {
			num[i] = sc.nextInt();
		}
		for (i = 0; i < N; ++i) {
			min = i;
			for (j = i; j < N; ++j) {
				if (num[min] > num[j]) {
					min = j;
				}
			}
			if (min != i) {
				int tmp = num[i];
				num[i] = num[min];
				num[min] = tmp;
				++count;
			}
		}
		for (i = 0; i < N; ++i) {
			System.out.print(num[i]);
			if (i != N - 1) {
				System.out.print(" ");
			}
		}
		System.out.print("\n");
		System.out.println(count);
		sc.close();
	}
}


/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