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();
		}
		selectionSort(A,N);
	}
	public static void selectionSort(int[] A,int N){
		int count=0;
		for(int i=0;i<N;i++){
			int minj=i;
			for(int j=i;j<N;j++){
				if(A[j]<A[minj])minj=j;
			}
			if(i!=minj){
				int c = A[i];
				A[i] = A[minj];
				A[minj] = c;
				count++;
			}
		}

		for(int i=0;i<N;i++){
			System.out.print(A[i]);
			if(i!=N-1)System.out.print(" ");
		}
		System.out.printf("\n%d\n",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