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();
		}
		Main main = new Main();
		int ans = main.selectionSort(a, n);
		for (int i = 0; i < n; i++) {
			if (i != n - 1) {
				System.out.print(a[i] + " ");
			} else {
				System.out.println(a[i]);
			}
		}
		System.out.println(ans);

	}

	// 選択ソート
	private int selectionSort(int[] a, int n) {
		int cnt = 0;// 入れ替えた回数

		for (int i = 0; i < n - 1; i++) {
			int minj = i;// 最小の要素を持つ位置

			for (int j = i; j < n; j++) {
				if (a[j] < a[minj]) {
					minj = j;
				}
			}

			if (i != minj) {
				int tmp = a[minj];
				a[minj] = a[i];
				a[i] = tmp;
				cnt++;
			}

		}
		return cnt;
	}

}
 import java.util.Scanner; Scanner java.util 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();
		}
		Main main = new Main();
		int ans = main.selectionSort(a, n);
		for (int i = 0; i < n; i++) {
			if (i != n - 1) {
				System.out.print(a[i] + " ");
			} else {
				System.out.println(a[i]);
			}
		}
		System.out.println(ans);

	}

	// 選択ソート
	private int selectionSort(int[] a, int n) {
		int cnt = 0;// 入れ替えた回数

		for (int i = 0; i < n - 1; i++) {
			int minj = i;// 最小の要素を持つ位置

			for (int j = i; j < n; j++) {
				if (a[j] < a[minj]) {
					minj = j;
				}
			}

			if (i != minj) {
				int tmp = a[minj];
				a[minj] = a[i];
				a[i] = tmp;
				cnt++;
			}

		}
		return cnt;
	}

} 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();
		}
		Main main = new Main();
		int ans = main.selectionSort(a, n);
		for (int i = 0; i < n; i++) {
			if (i != n - 1) {
				System.out.print(a[i] + " ");
			} else {
				System.out.println(a[i]);
			}
		}
		System.out.println(ans);

	} main {

		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();
		}
		Main main = new Main();
		int ans = main.selectionSort(a, n);
		for (int i = 0; i < n; i++) {
			if (i != n - 1) {
				System.out.print(a[i] + " ");
			} else {
				System.out.println(a[i]);
			}
		}
		System.out.println(ans);

	} Scanner sc = new Scanner(System.in); sc new Scanner(System.in) 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 Main main = new Main(); main new Main() int ans = main.selectionSort(a, n); ans main.selectionSort(a, n) main.selectionSort main a n for (int i = 0; i < n; i++) {
			if (i != n - 1) {
				System.out.print(a[i] + " ");
			} else {
				System.out.println(a[i]);
			}
		} int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
			if (i != n - 1) {
				System.out.print(a[i] + " ");
			} else {
				System.out.println(a[i]);
			}
		} {
			if (i != n - 1) {
				System.out.print(a[i] + " ");
			} else {
				System.out.println(a[i]);
			}
		} if (i != n - 1) {
				System.out.print(a[i] + " ");
			} else {
				System.out.println(a[i]);
			} i != n - 1 i n - 1 n 1 {
				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[i]);
			} System.out.println(a[i]) System.out.println System.out System System.out a[i] a i System.out.println(ans) System.out.println System.out System System.out ans String[] args args // 選択ソート
	private int selectionSort(int[] a, int n) {
		int cnt = 0;// 入れ替えた回数

		for (int i = 0; i < n - 1; i++) {
			int minj = i;// 最小の要素を持つ位置

			for (int j = i; j < n; j++) {
				if (a[j] < a[minj]) {
					minj = j;
				}
			}

			if (i != minj) {
				int tmp = a[minj];
				a[minj] = a[i];
				a[i] = tmp;
				cnt++;
			}

		}
		return cnt;
	} selectionSort {
		int cnt = 0;// 入れ替えた回数

		for (int i = 0; i < n - 1; i++) {
			int minj = i;// 最小の要素を持つ位置

			for (int j = i; j < n; j++) {
				if (a[j] < a[minj]) {
					minj = j;
				}
			}

			if (i != minj) {
				int tmp = a[minj];
				a[minj] = a[i];
				a[i] = tmp;
				cnt++;
			}

		}
		return cnt;
	} int cnt = 0; cnt 0 for (int i = 0; i < n - 1; i++) {
			int minj = i;// 最小の要素を持つ位置

			for (int j = i; j < n; j++) {
				if (a[j] < a[minj]) {
					minj = j;
				}
			}

			if (i != minj) {
				int tmp = a[minj];
				a[minj] = a[i];
				a[i] = tmp;
				cnt++;
			}

		} int i = 0; int i = 0; i 0 i < n - 1 i n - 1 n 1 i++ i++ i {
			int minj = i;// 最小の要素を持つ位置

			for (int j = i; j < n; j++) {
				if (a[j] < a[minj]) {
					minj = j;
				}
			}

			if (i != minj) {
				int tmp = a[minj];
				a[minj] = a[i];
				a[i] = tmp;
				cnt++;
			}

		} {
			int minj = i;// 最小の要素を持つ位置

			for (int j = i; j < n; j++) {
				if (a[j] < a[minj]) {
					minj = j;
				}
			}

			if (i != minj) {
				int tmp = a[minj];
				a[minj] = a[i];
				a[i] = tmp;
				cnt++;
			}

		} 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 tmp = a[minj];
				a[minj] = a[i];
				a[i] = tmp;
				cnt++;
			} i != minj i minj {
				int tmp = a[minj];
				a[minj] = a[i];
				a[i] = tmp;
				cnt++;
			} int tmp = a[minj]; tmp a[minj] a minj a[minj] = a[i] a[minj] a minj a[i] a i a[i] = tmp a[i] a i tmp cnt++ cnt return cnt; cnt int[] a a int n n 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();
		}
		Main main = new Main();
		int ans = main.selectionSort(a, n);
		for (int i = 0; i < n; i++) {
			if (i != n - 1) {
				System.out.print(a[i] + " ");
			} else {
				System.out.println(a[i]);
			}
		}
		System.out.println(ans);

	}

	// 選択ソート
	private int selectionSort(int[] a, int n) {
		int cnt = 0;// 入れ替えた回数

		for (int i = 0; i < n - 1; i++) {
			int minj = i;// 最小の要素を持つ位置

			for (int j = i; j < n; j++) {
				if (a[j] < a[minj]) {
					minj = j;
				}
			}

			if (i != minj) {
				int tmp = a[minj];
				a[minj] = a[i];
				a[i] = tmp;
				cnt++;
			}

		}
		return cnt;
	}

} 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();
		}
		Main main = new Main();
		int ans = main.selectionSort(a, n);
		for (int i = 0; i < n; i++) {
			if (i != n - 1) {
				System.out.print(a[i] + " ");
			} else {
				System.out.println(a[i]);
			}
		}
		System.out.println(ans);

	}

	// 選択ソート
	private int selectionSort(int[] a, int n) {
		int cnt = 0;// 入れ替えた回数

		for (int i = 0; i < n - 1; i++) {
			int minj = i;// 最小の要素を持つ位置

			for (int j = i; j < n; j++) {
				if (a[j] < a[minj]) {
					minj = j;
				}
			}

			if (i != minj) {
				int tmp = a[minj];
				a[minj] = a[i];
				a[i] = tmp;
				cnt++;
			}

		}
		return cnt;
	}

} Main
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();
		}
		Main main = new Main();
		int ans = main.selectionSort(a, n);
		for (int i = 0; i < n; i++) {
			if (i != n - 1) {
				System.out.print(a[i] + " ");
			} else {
				System.out.println(a[i]);
			}
		}
		System.out.println(ans);

	}

	// 選択ソート
	private int selectionSort(int[] a, int n) {
		int cnt = 0;// 入れ替えた回数

		for (int i = 0; i < n - 1; i++) {
			int minj = i;// 最小の要素を持つ位置

			for (int j = i; j < n; j++) {
				if (a[j] < a[minj]) {
					minj = j;
				}
			}

			if (i != minj) {
				int tmp = a[minj];
				a[minj] = a[i];
				a[i] = tmp;
				cnt++;
			}

		}
		return cnt;
	}

}

