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

import java.io.*;
public class Main {
    public static void main(String[] args) throws IOException{
        BufferedReader buf=new BufferedReader(new InputStreamReader(System.in));
        int a=Integer.parseInt(buf.readLine());
        int[] num=new int[a];
        int i,j,tmp,min;
        int cnt=0;
        String[] str=buf.readLine().split(" ");
        for(i=0;i<num.length;i++){
            num[i]=Integer.parseInt(str[i]);
        }
        
        for(i=0;i<num.length-1;i++){
            min=i;
            for(j=i+1;j<num.length;j++){
                    if(num[j]<num[j-1]){
                        min=j;
                    }
            }
            if(num[i]>num[min]){
                cnt++;
        tmp=num[i];
        num[i]=num[min];
        num[min]=tmp;
            }
        }
        for(int x=0;x<num.length-1;x++){
            System.out.print(num[x]+" ");
}
        System.out.println(num[a-1]);
        System.out.println(cnt);
    }
}