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: WA: Presentation Error)

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.ArrayList;

public class Main {

	public static void main(String[] args) throws IOException{
		// TODO Auto-generated method stub

		ArrayList<String> in = readInputs();
		String[] tmp = in.get(1).split(" ");
		int[] num = new int[tmp.length];
		for(int i=0; i<tmp.length;i++){
			num[i] = Integer.parseInt(tmp[i]);
		}
		int cnt = sort(num);
		for(int i:num ){
			System.out.print(i);
			System.out.print(" ");
		}
		System.out.println("");
		System.out.println(cnt);

	}
	
	static ArrayList<String> readInputs() throws IOException{
		ArrayList<String> tmp = new ArrayList<String>();
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		while(br.ready()){
			tmp.add(br.readLine());
		}
		return tmp;
	}

	static int sort(int[] num){
		int cnt=0;
		for(int i=0; i<num.length; i++){
			int mini=i;
			for(int j=i; j<num.length; j++){
				if(num[mini] > num[j]){
					mini = j;
				}
			}
			if(mini != i){
				int tmp = num[i];
				num[i] = num[mini];
				num[mini] = tmp;
				cnt++;
			}
		}
		return cnt;
	}
}