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

#!/usr/bin/env python3
# coding: utf_8

n = int(input())
a = list(map(int, input().split()))
count = 0

for i1 in range(n):
    mini2 = i1
    for i2 in range(len(a[i1:])):
        i2 += i1
        if a[i2] < a[mini2]:
            mini2 = i2
    if i1 != mini2:
        temp = a[i1]
        a[i1] = a[mini2]
        a[mini2] = temp
        count +=1

print(a[0], end="")
for i in a[1:]:
    print(" {}".format(i),end="")

print("\n{}".format(count))