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

public class Main {

	public static void main(String[] args) {
			Scanner scanner = new Scanner(System.in);
			int n = scanner.nextInt();
			int A[] = new int[n];
			for(int i = 0; i < n; i++) {
				A[i] = scanner.nextInt();
			}

			scanner.close();
			int changeCount = 0;

			//選択ソート
			for(int i = 0; i < A.length; i++) {
				int minIndex = i;
				for(int j = i; j < A.length; j++) {
					if(A[minIndex] > A[j]) {
						minIndex = j;
					}
				}
			//最小値が変わっていなければ値交換はしなくてよい
			if(minIndex == i) continue;
			//値交換
			int tmp = A[i];
			A[i] = A[minIndex];
			A[minIndex] = tmp;
			changeCount++;
			}
			System.out.println(Arrays.toString(A).replaceAll("[,\\[\\]]", ""));
			System.out.println(changeCount);
	 }
}

/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