import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		Main main = new Main();
		int A[] = new int[100]; // sufficient
		int N = sc.nextInt();
		for (int i = 0; i < N; ++i)
			A[i] = sc.nextInt();
		int swapcnt = main.selectionSort(A, N);
		for (int i = 0; i < N; ++i) {
			// to join A by " "(space).
			if (i > 0) System.out.print(" ");
			System.out.print(A[i]);
		}
		System.out.println();
		System.out.println(swapcnt);
	}
	/* sort array A(size: N) by using Selection Sort. */
	/* return counts of swapping. */
	public int selectionSort(int A[], int N) {
		int swapcnt = 0;
		for (int i = 0; i < N; ++i) {
			// assume index pointing min{A} is i.
			int minj = i;
			// linear search for index pointing min{A}.
			for (int j = i; j < N; ++j) {
				if (A[j] < A[minj])
					minj = j;
			}
			// not swap when i == minj.
			if (i == minj)
				continue;
			// swapping A[i] for A[minj](i != minj).
			int tmp = A[i];
			A[i] = A[minj];
			A[minj] = tmp;
			++swapcnt;
		}
		return swapcnt;
	}
} import java.util.Scanner; Scanner java.util public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		Main main = new Main();
		int A[] = new int[100]; // sufficient
		int N = sc.nextInt();
		for (int i = 0; i < N; ++i)
			A[i] = sc.nextInt();
		int swapcnt = main.selectionSort(A, N);
		for (int i = 0; i < N; ++i) {
			// to join A by " "(space).
			if (i > 0) System.out.print(" ");
			System.out.print(A[i]);
		}
		System.out.println();
		System.out.println(swapcnt);
	}
	/* sort array A(size: N) by using Selection Sort. */
	/* return counts of swapping. */
	public int selectionSort(int A[], int N) {
		int swapcnt = 0;
		for (int i = 0; i < N; ++i) {
			// assume index pointing min{A} is i.
			int minj = i;
			// linear search for index pointing min{A}.
			for (int j = i; j < N; ++j) {
				if (A[j] < A[minj])
					minj = j;
			}
			// not swap when i == minj.
			if (i == minj)
				continue;
			// swapping A[i] for A[minj](i != minj).
			int tmp = A[i];
			A[i] = A[minj];
			A[minj] = tmp;
			++swapcnt;
		}
		return swapcnt;
	}
} Main public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		Main main = new Main();
		int A[] = new int[100]; // sufficient
		int N = sc.nextInt();
		for (int i = 0; i < N; ++i)
			A[i] = sc.nextInt();
		int swapcnt = main.selectionSort(A, N);
		for (int i = 0; i < N; ++i) {
			// to join A by " "(space).
			if (i > 0) System.out.print(" ");
			System.out.print(A[i]);
		}
		System.out.println();
		System.out.println(swapcnt);
	} main {
		Scanner sc = new Scanner(System.in);
		Main main = new Main();
		int A[] = new int[100]; // sufficient
		int N = sc.nextInt();
		for (int i = 0; i < N; ++i)
			A[i] = sc.nextInt();
		int swapcnt = main.selectionSort(A, N);
		for (int i = 0; i < N; ++i) {
			// to join A by " "(space).
			if (i > 0) System.out.print(" ");
			System.out.print(A[i]);
		}
		System.out.println();
		System.out.println(swapcnt);
	} Scanner sc = new Scanner(System.in); sc new Scanner(System.in) Main main = new Main(); main new Main() int A[] = new int[100]; A new int[100] 100 int N = sc.nextInt(); N sc.nextInt() sc.nextInt sc 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] A i sc.nextInt() sc.nextInt sc int swapcnt = main.selectionSort(A, N); swapcnt main.selectionSort(A, N) main.selectionSort main A N for (int i = 0; i < N; ++i) {
			// to join A by " "(space).
			if (i > 0) System.out.print(" ");
			System.out.print(A[i]);
		} int i = 0; int i = 0; i 0 i < N i N ++i ++i i {
			// to join A by " "(space).
			if (i > 0) System.out.print(" ");
			System.out.print(A[i]);
		} {
			// to join A by " "(space).
			if (i > 0) System.out.print(" ");
			System.out.print(A[i]);
		} if (i > 0) System.out.print(" "); i > 0 i 0 System.out.print(" ") System.out.print System.out System System.out " " System.out.print(A[i]) System.out.print System.out System System.out A[i] A i System.out.println() System.out.println System.out System System.out System.out.println(swapcnt) System.out.println System.out System System.out swapcnt String[] args args /* sort array A(size: N) by using Selection Sort. */
	/* return counts of swapping. */
	public int selectionSort(int A[], int N) {
		int swapcnt = 0;
		for (int i = 0; i < N; ++i) {
			// assume index pointing min{A} is i.
			int minj = i;
			// linear search for index pointing min{A}.
			for (int j = i; j < N; ++j) {
				if (A[j] < A[minj])
					minj = j;
			}
			// not swap when i == minj.
			if (i == minj)
				continue;
			// swapping A[i] for A[minj](i != minj).
			int tmp = A[i];
			A[i] = A[minj];
			A[minj] = tmp;
			++swapcnt;
		}
		return swapcnt;
	} selectionSort {
		int swapcnt = 0;
		for (int i = 0; i < N; ++i) {
			// assume index pointing min{A} is i.
			int minj = i;
			// linear search for index pointing min{A}.
			for (int j = i; j < N; ++j) {
				if (A[j] < A[minj])
					minj = j;
			}
			// not swap when i == minj.
			if (i == minj)
				continue;
			// swapping A[i] for A[minj](i != minj).
			int tmp = A[i];
			A[i] = A[minj];
			A[minj] = tmp;
			++swapcnt;
		}
		return swapcnt;
	} int swapcnt = 0; swapcnt 0 for (int i = 0; i < N; ++i) {
			// assume index pointing min{A} is i.
			int minj = i;
			// linear search for index pointing min{A}.
			for (int j = i; j < N; ++j) {
				if (A[j] < A[minj])
					minj = j;
			}
			// not swap when i == minj.
			if (i == minj)
				continue;
			// swapping A[i] for A[minj](i != minj).
			int tmp = A[i];
			A[i] = A[minj];
			A[minj] = tmp;
			++swapcnt;
		} int i = 0; int i = 0; i 0 i < N i N ++i ++i i {
			// assume index pointing min{A} is i.
			int minj = i;
			// linear search for index pointing min{A}.
			for (int j = i; j < N; ++j) {
				if (A[j] < A[minj])
					minj = j;
			}
			// not swap when i == minj.
			if (i == minj)
				continue;
			// swapping A[i] for A[minj](i != minj).
			int tmp = A[i];
			A[i] = A[minj];
			A[minj] = tmp;
			++swapcnt;
		} {
			// assume index pointing min{A} is i.
			int minj = i;
			// linear search for index pointing min{A}.
			for (int j = i; j < N; ++j) {
				if (A[j] < A[minj])
					minj = j;
			}
			// not swap when i == minj.
			if (i == minj)
				continue;
			// swapping A[i] for A[minj](i != minj).
			int tmp = A[i];
			A[i] = A[minj];
			A[minj] = tmp;
			++swapcnt;
		} 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 if (i == minj)
				continue; i == minj i minj continue; int tmp = A[i]; tmp A[i] A i A[i] = A[minj] A[i] A i A[minj] A minj A[minj] = tmp A[minj] A minj tmp ++swapcnt swapcnt return swapcnt; swapcnt int A[] A int N N public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		Main main = new Main();
		int A[] = new int[100]; // sufficient
		int N = sc.nextInt();
		for (int i = 0; i < N; ++i)
			A[i] = sc.nextInt();
		int swapcnt = main.selectionSort(A, N);
		for (int i = 0; i < N; ++i) {
			// to join A by " "(space).
			if (i > 0) System.out.print(" ");
			System.out.print(A[i]);
		}
		System.out.println();
		System.out.println(swapcnt);
	}
	/* sort array A(size: N) by using Selection Sort. */
	/* return counts of swapping. */
	public int selectionSort(int A[], int N) {
		int swapcnt = 0;
		for (int i = 0; i < N; ++i) {
			// assume index pointing min{A} is i.
			int minj = i;
			// linear search for index pointing min{A}.
			for (int j = i; j < N; ++j) {
				if (A[j] < A[minj])
					minj = j;
			}
			// not swap when i == minj.
			if (i == minj)
				continue;
			// swapping A[i] for A[minj](i != minj).
			int tmp = A[i];
			A[i] = A[minj];
			A[minj] = tmp;
			++swapcnt;
		}
		return swapcnt;
	}
} public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		Main main = new Main();
		int A[] = new int[100]; // sufficient
		int N = sc.nextInt();
		for (int i = 0; i < N; ++i)
			A[i] = sc.nextInt();
		int swapcnt = main.selectionSort(A, N);
		for (int i = 0; i < N; ++i) {
			// to join A by " "(space).
			if (i > 0) System.out.print(" ");
			System.out.print(A[i]);
		}
		System.out.println();
		System.out.println(swapcnt);
	}
	/* sort array A(size: N) by using Selection Sort. */
	/* return counts of swapping. */
	public int selectionSort(int A[], int N) {
		int swapcnt = 0;
		for (int i = 0; i < N; ++i) {
			// assume index pointing min{A} is i.
			int minj = i;
			// linear search for index pointing min{A}.
			for (int j = i; j < N; ++j) {
				if (A[j] < A[minj])
					minj = j;
			}
			// not swap when i == minj.
			if (i == minj)
				continue;
			// swapping A[i] for A[minj](i != minj).
			int tmp = A[i];
			A[i] = A[minj];
			A[minj] = tmp;
			++swapcnt;
		}
		return swapcnt;
	}
} Main
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		Main main = new Main();
		int A[] = new int[100]; // sufficient
		int N = sc.nextInt();
		for (int i = 0; i < N; ++i)
			A[i] = sc.nextInt();
		int swapcnt = main.selectionSort(A, N);
		for (int i = 0; i < N; ++i) {
			// to join A by " "(space).
			if (i > 0) System.out.print(" ");
			System.out.print(A[i]);
		}
		System.out.println();
		System.out.println(swapcnt);
	}
	/* sort array A(size: N) by using Selection Sort. */
	/* return counts of swapping. */
	public int selectionSort(int A[], int N) {
		int swapcnt = 0;
		for (int i = 0; i < N; ++i) {
			// assume index pointing min{A} is i.
			int minj = i;
			// linear search for index pointing min{A}.
			for (int j = i; j < N; ++j) {
				if (A[j] < A[minj])
					minj = j;
			}
			// not swap when i == minj.
			if (i == minj)
				continue;
			// swapping A[i] for A[minj](i != minj).
			int tmp = A[i];
			A[i] = A[minj];
			A[minj] = tmp;
			++swapcnt;
		}
		return swapcnt;
	}
}
