

import java.util.Arrays;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int N = scan.nextInt();
		int[] A = new int[N];
		for (int i = 0; i < N; i++) {
			A[i] = scan.nextInt();
		}
		selectionSrot(A, N);
		scan.close();
	}

	public static void selectionSrot(int[] A, int N) {
		// ???????????°
		int count = 0;
		
		for (int i = 0; i < N - 1; i++) {
			// ???????????????????????????????????\??¨
			int initialA = A[i];
			int minIndex = i;
			for (int j = i + 1; j < A.length; j++) {
				if (A[minIndex] > A[j]) {
					minIndex = j;
				}
			}
			// ????°??????????????????????????????¨??????
			int temp = A[i];
			A[i] = A[minIndex];
			A[minIndex] = temp;
			// ???????????????????????§??????
			if (initialA != A[i]) {
				count++;
			}

		}
		
		String output = Arrays.toString(A).replaceAll(",", "");
		System.out.println(output.substring(1, output.length() - 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