

import java.util.Scanner;

public class Main {
	public static void main(String [] args){
		Scanner sc = new Scanner(System.in);
		int koukansize = 0;
		int N = sc.nextInt();
		int [] a = new int [N];
		for(int i=0; i<N; i++){
			a[i] = sc.nextInt();
		}
		
		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 ste = a[i];
				a[i] = a[minj];
				a[minj] = ste;
				koukansize++;
			}
		
		}
		for(int i=0; i<N-1; i++){
			System.out.print(a[i]+" ");
		}
		System.out.println(a[N-1]);
		System.out.println(koukansize);
		sc.close();
	}
		
} import java.util.Scanner; Scanner java.util public class Main {
	public static void main(String [] args){
		Scanner sc = new Scanner(System.in);
		int koukansize = 0;
		int N = sc.nextInt();
		int [] a = new int [N];
		for(int i=0; i<N; i++){
			a[i] = sc.nextInt();
		}
		
		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 ste = a[i];
				a[i] = a[minj];
				a[minj] = ste;
				koukansize++;
			}
		
		}
		for(int i=0; i<N-1; i++){
			System.out.print(a[i]+" ");
		}
		System.out.println(a[N-1]);
		System.out.println(koukansize);
		sc.close();
	}
		
} Main public static void main(String [] args){
		Scanner sc = new Scanner(System.in);
		int koukansize = 0;
		int N = sc.nextInt();
		int [] a = new int [N];
		for(int i=0; i<N; i++){
			a[i] = sc.nextInt();
		}
		
		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 ste = a[i];
				a[i] = a[minj];
				a[minj] = ste;
				koukansize++;
			}
		
		}
		for(int i=0; i<N-1; i++){
			System.out.print(a[i]+" ");
		}
		System.out.println(a[N-1]);
		System.out.println(koukansize);
		sc.close();
	} main {
		Scanner sc = new Scanner(System.in);
		int koukansize = 0;
		int N = sc.nextInt();
		int [] a = new int [N];
		for(int i=0; i<N; i++){
			a[i] = sc.nextInt();
		}
		
		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 ste = a[i];
				a[i] = a[minj];
				a[minj] = ste;
				koukansize++;
			}
		
		}
		for(int i=0; i<N-1; i++){
			System.out.print(a[i]+" ");
		}
		System.out.println(a[N-1]);
		System.out.println(koukansize);
		sc.close();
	} Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int koukansize = 0; koukansize 0 int N = sc.nextInt(); N sc.nextInt() sc.nextInt sc int [] a = new int [N]; a new int [N] N for(int i=0; i<N; i++){
			a[i] = sc.nextInt();
		} int i=0; int i=0; i 0 i<N i N i++ i++ i {
			a[i] = sc.nextInt();
		} {
			a[i] = sc.nextInt();
		} a[i] = sc.nextInt() a[i] a i sc.nextInt() sc.nextInt sc 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 ste = a[i];
				a[i] = a[minj];
				a[minj] = ste;
				koukansize++;
			}
		
		} int i=0; int i=0; i 0 i<N i N i++ i++ i {
			int minj = i;
			for(int j=i; j<N; j++){
				if(a[j] < a[minj]){
					minj = j;
				}
			}
			if(i!=minj){
				int ste = a[i];
				a[i] = a[minj];
				a[minj] = ste;
				koukansize++;
			}
		
		} {
			int minj = i;
			for(int j=i; j<N; j++){
				if(a[j] < a[minj]){
					minj = j;
				}
			}
			if(i!=minj){
				int ste = a[i];
				a[i] = a[minj];
				a[minj] = ste;
				koukansize++;
			}
		
		} int minj = i; minj i for(int j=i; j<N; j++){
				if(a[j] < a[minj]){
					minj = j;
				}
			} int j=i; int j=i; j i j<N j N j++ j++ j {
				if(a[j] < a[minj]){
					minj = j;
				}
			} {
				if(a[j] < a[minj]){
					minj = j;
				}
			} if(a[j] < a[minj]){
					minj = j;
				} a[j] < a[minj] a[j] a j a[minj] a minj {
					minj = j;
				} minj = j minj j if(i!=minj){
				int ste = a[i];
				a[i] = a[minj];
				a[minj] = ste;
				koukansize++;
			} i!=minj i minj {
				int ste = a[i];
				a[i] = a[minj];
				a[minj] = ste;
				koukansize++;
			} int ste = a[i]; ste a[i] a i a[i] = a[minj] a[i] a i a[minj] a minj a[minj] = ste a[minj] a minj ste koukansize++ koukansize for(int i=0; i<N-1; i++){
			System.out.print(a[i]+" ");
		} int i=0; int i=0; i 0 i<N-1 i N-1 N 1 i++ i++ i {
			System.out.print(a[i]+" ");
		} {
			System.out.print(a[i]+" ");
		} System.out.print(a[i]+" ") System.out.print System.out System System.out a[i]+" " a[i] a i " " System.out.println(a[N-1]) System.out.println System.out System System.out a[N-1] a N-1 N 1 System.out.println(koukansize) System.out.println System.out System System.out koukansize sc.close() sc.close sc String [] args args public class Main {
	public static void main(String [] args){
		Scanner sc = new Scanner(System.in);
		int koukansize = 0;
		int N = sc.nextInt();
		int [] a = new int [N];
		for(int i=0; i<N; i++){
			a[i] = sc.nextInt();
		}
		
		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 ste = a[i];
				a[i] = a[minj];
				a[minj] = ste;
				koukansize++;
			}
		
		}
		for(int i=0; i<N-1; i++){
			System.out.print(a[i]+" ");
		}
		System.out.println(a[N-1]);
		System.out.println(koukansize);
		sc.close();
	}
		
} public class Main {
	public static void main(String [] args){
		Scanner sc = new Scanner(System.in);
		int koukansize = 0;
		int N = sc.nextInt();
		int [] a = new int [N];
		for(int i=0; i<N; i++){
			a[i] = sc.nextInt();
		}
		
		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 ste = a[i];
				a[i] = a[minj];
				a[minj] = ste;
				koukansize++;
			}
		
		}
		for(int i=0; i<N-1; i++){
			System.out.print(a[i]+" ");
		}
		System.out.println(a[N-1]);
		System.out.println(koukansize);
		sc.close();
	}
		
} Main


import java.util.Scanner;

public class Main {
	public static void main(String [] args){
		Scanner sc = new Scanner(System.in);
		int koukansize = 0;
		int N = sc.nextInt();
		int [] a = new int [N];
		for(int i=0; i<N; i++){
			a[i] = sc.nextInt();
		}
		
		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 ste = a[i];
				a[i] = a[minj];
				a[minj] = ste;
				koukansize++;
			}
		
		}
		for(int i=0; i<N-1; i++){
			System.out.print(a[i]+" ");
		}
		System.out.println(a[N-1]);
		System.out.println(koukansize);
		sc.close();
	}
		
}