import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int array[] = new int[N];
		int minj, tmp, pointer = 0, count = 0;

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

		for(int i = 0; i < array.length; i ++){
			minj = Integer.MAX_VALUE;
			for(int j = i ; j < array.length; j++){
				if(i != j){
					if(array[j] < minj){
					minj = array[j];
					pointer = j;
					}
				}
			}
			if(array[i] > minj){
				tmp = array[i];
				array[i] = minj;
				array[pointer] = tmp;
				count++;
			}
		}
		for(int i = 0; i < array.length; i++){
			if(i == array.length -1){
				System.out.println(array[i]);
			}else{
				System.out.print(array[i] + " ");
			}
		}
		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