import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int len = scanner.nextInt();
		int nums[] = new int[len];
		int count = 0;

		for (int i = 0; i < nums.length; i++) {
			nums[i] = scanner.nextInt();
		}

		int minIdx = 0;

		for (int j = 0; j < nums.length; j++) {
			minIdx = j;
			for (int j2 = j; j2 < nums.length; j2++) {
				if (nums[j2] < nums[minIdx]) {
					minIdx = j2;
				}
			}
			if (minIdx != j) {
				int minValue = nums[minIdx];
				nums[minIdx] = nums[j];
				nums[j] = minValue;
				count++;
			}
		}
		new Main().arrayToString(nums);
		System.out.println(count);
	}

	public void arrayToString(int[] arr) {
		for (int i = 0; i < arr.length; i++) {

			if (i == arr.length - 1) {
				System.out.println(arr[i]);
			} else {
				System.out.print(arr[i] + " ");
			}
		}
	}

}

/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