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 JavaScript (judge verdict: Accepted)

function selectionSort(lgh, arr) {
  var count = 0;
  for(let i = 0; i < lgh-1; i++) {
    var tmp = i;
    for(let j = i; j < lgh; j++) {
      if(Number(arr[j]) < Number(arr[tmp])) {
        tmp = j;
      }
    }
    if(i != tmp) {
      [arr[i], arr[tmp]] = [arr[tmp], arr[i]];
      count++;
    }
  }
  console.log(arr.join(" "));
  return count;
}
function Main(input) {
  var [a, b] = input.split("\n");
  console.log(selectionSort(a, b.split(" ")));
}
Main(require("fs").readFileSync("/dev/stdin", "utf8"));