import java.util.Scanner;

public class Main {
	public static int selectionSort(int[] ary,int num){
		int min,tmp,cnt=0;
		for(int i=0;i<num;i++){
			min=i;
			for(int j=i+1;j<num;j++){
				if(ary[j]<ary[min]){
					min=j;
				}
			}
				if(i!=min){
					cnt++;
					tmp=ary[i];
					ary[i]=ary[min];
					ary[min]=tmp;
			}
		}
		return cnt;
	}

	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		int n=sc.nextInt();
		int[] a;
		a = new int[n];
		for(int i=0;i<n;i++){
			a[i]=sc.nextInt();
		}
		int cnt = selectionSort(a,n);
		for(int i=0;i<n-1;i++){
			System.out.printf("%d ",a[i]);
		}
		System.out.printf("%d",a[n-1]);
		System.out.printf("\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