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.Scanner;

public class Main{
    public static void main(String[] args){
	
	//配列の要素数
	Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
	
	//配列の要素
	int A[] = new int[n];	
	for(int i=0;i<A.length;i++){
	    A[i]= scanner.nextInt();
	}
	Sort(A,n);
    }
    //並べ替え
    private static void Sort(int A[], int n){
	int count = 0;
	
	for(int i=0; i < n; i++){
	    //並べ替えが終っていたらループを抜ける
	    int b = Judgement(A,n);
	    if(b == 1) break;
	    
	    int minj = i;
	    for(int j=i; j < n; j++){
		if(A[j] < A[minj]){
		    minj = j;
		}
	    }
	    //A[i]とA[minj]を交換
	    if(n > 1){
		int a = A[i];
		A[i] = A[minj];
		A[minj] = a;
		count++;
	    }
	}
	//表示
	Print(A,n);
	System.out.println(count);
    }
    //表示
    private static void Print(int A[], int n){
	for(int k=0;k<A.length;k++){
	    System.out.print(A[k]);
	    if(k < (n-1)){
		System.out.print(" ");
	    }
	}
	System.out.println();
    }
    //並べ替えが終っているかを判定
    private static int Judgement(int A[], int n){
	int count = 0;
	for(int i=0; i < n; i++) if(A[i] == i+1) count++;
	if(count == n) return 1;
	else return 0;
    }
}