Problem:
Selection Sort

Write a program of the Selection Sort algorithm which sorts a sequence A in ascending order. The algorithm should be based on the following pseudocode:

SelectionSort(A)
1 for i = 0 to A.length-1
2 mini = i
3 for j = i to A.length-1
4 if A[j] < A[mini]
5 mini = j
6 swap A[i] and A[mini]

Note that, indices for array elements are based on 0-origin.

Your program should also print the number of swap operations defined in line 6 of the pseudocode in the case where i ≠ mini.

Input

The first line of the input includes an integer N, the number of elements in the sequence.

In the second line, N elements of the sequence are given separated by space characters.

Output

The output consists of 2 lines.

In the first line, please print the sorted sequence. Two contiguous elements of the sequence should be separated by a space character.

In the second line, please print the number of swap operations.

Constraints

1 ≤ N ≤ 100

Sample Input 1

6
5 6 4 2 1 3

Sample Output 1

1 2 3 4 5 6
4

Sample Input 2

6
5 2 4 6 1 3

Sample Output 2

1 2 3 4 5 6
3

Solution in C# (judge verdict: Accepted)

using System;

namespace SelectionSort
{
	class MainClass
	{
		public static void trace(ref int[] arr) {
			for (int i = 0; i < arr.Length; ++i) {
				if (i > 0)
					Console.Write (" ");
				Console.Write (arr [i]);
			}
			Console.WriteLine ();
		}

		public static void Main (string[] args)
		{
			int n = int.Parse (Console.ReadLine ());
			string[] nums = (Console.ReadLine ()).Split (' ');
			int[] arr = new int[n];
			for (int i = 0; i < n; ++i)
				arr [i] = int.Parse (nums [i]);

			selectionSort (ref arr);

		}

		public static void selectionSort(ref int[] arr) {

			int numSwap = 0;
			for (int i = 0; i < arr.Length; ++i) {
				int minj = i;
				for (int j = i; j < arr.Length; ++j) {
					if (arr [j] < arr [minj])
						minj = j;
				}

				if (i != minj) {
					int tmp = arr [i];
					arr [i] = arr [minj];
					arr [minj] = tmp;
					++numSwap;
				}
			}

			trace (ref arr);
			Console.WriteLine (numSwap);

		}
	}
}