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

#選択ソートのプログラム
#選択ソートは、各計算ステップで１つの最小値を選択していくアルゴリズムです。

#Swap関数
def Swap(x, y)
    return y, x
end

#データの個数を入力する
n = STDIN.gets.chomp.to_i

#データを入力する
data = STDIN.gets.chomp.split(" ").map(&:to_i)

#n個の要素を持つ配列を作成する。
A = Array.new(n)

#データを代入する
for i in 0..n-1
    A[i] = data[i]
end

count = 0
#選択ソートを実施する。
for i in 0..n-1
    minj = i
    for j in i..n-1
        if A[j] < A[minj] then
            minj = j
        end
    end

    #入れ替える必要があるとき要素を入れ替える
    if i != minj then
        A[i], A[minj] = Swap(A[i], A[minj])
        count += 1
    end
end

#選択ソートの結果を出力する
for i in 0..n-2
    print "#{A[i]} "
end
puts "#{A[n-1]}"
puts "#{count}"