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 Scala (judge verdict: Wrong Answer)

import scala.io.StdIn.{readInt, readLine}
object Main {
    def main(args: Array[String]): Unit = {
        readInt
        val arr = readLine.split(" ").map(_.toInt)
        val (ret, cnt) = selectionSort(arr)
        println(ret.mkString(" "))
        println(cnt)
    }
    
    def selectionSort(arr: Array[Int]): (Array[Int], Int) = {
        def min(arr: Array[Int], ptr: Int): Int = {
            if ((arr.length - 1) == ptr) return ptr
            min(arr, ptr + 1) match {
                case m if arr(ptr) < arr(m) => ptr
                case m: Int => m
            }
        }
        def swap(arr: Array[Int], a: Int, b: Int): Unit = {
            val tmp = arr(a)
            arr(a) = arr(b)
            arr(b) = tmp
        }
        var cnt = 0
        val copy = new Array[Int](arr.length)
        arr.copyToArray(copy)
        (0 until copy.length).foreach {i =>
            val m = min(copy, i)
            if (m != i) {swap(copy, m, i); cnt += 1}
        }
        (copy, cnt)
    }
}