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.util.Arrays;
public class Main {        
	int[] random(int n) {        
		int[] a = new int[n];        
		for(int i = 0; i < n; i++) {            
			a[i] = (int)(Math.random() * 1000);       
		}        return a;    }        
	void swap(int[] a, int i, int j) {        
		int temp = a[i];        
		a[i] = a[j];        
		a[j] = temp;    
	}       
	void bubbleSort(int[] a) {       
		// バブルソート 未完成   
		for(int f =1; f<a.length; f++) {
		for(int i = 1; i < a.length; i++) {            
			if(a[i-1] > a[i]) {                
				swap(a, i-1, i);            
			}  
		}
		}    
	}   
	void quickSort(int[] a) {       
		// クイックソートを作ります    
	}    
	void main() {        
		int[] a = {5, 3, 1, 9, 8, 0, 4, 2, 7, 6};        
		//int[] a = random(100);        
		System.out.println("Before: " + Arrays.toString(a));       
		long s = System.nanoTime();        bubbleSort(a);        
		System.out.println("After " + Arrays.toString(a));       
		long e = System.nanoTime();        
		System.out.println("Time " + ((e - s) / 1000000f) + " ms");   
	}
	public static void main(String[] args) {       
		new Main().main();    
	}

}