

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();
		}

		// 解法
		// Selection sort, cntは交換回数
		int cnt = 0;
		for (int i = 0; i < N - 1; i++) {
			int minID = i;
			for (int j = i; j < N; j++) {
				if (A[minID] > A[j]) {
					minID = j;
				}
			}
			if (minID != i) {
				cnt++;
				int w = A[i];
				A[i] = A[minID];
				A[minID] = w;
			}
		}

		for (int i = 0; i < A.length; i++) {
			System.out.print(A[i] + (i != A.length - 1 ? " " : "\n"));
		}
		System.out.println(cnt);

		// 入力の開放
		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