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.

Constraints

1 ≤ N ≤ 100

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.

Examples

Input

6
5 6 4 2 1 3


Output

1 2 3 4 5 6
4


Input

6
5 2 4 6 1 3


Output

1 2 3 4 5 6
3
import java.util.Scanner;

public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    
    int N = sc.nextInt(),x,y,count = 0;
    int[] n = new int[N];
    
    for(int i = 0; i < N; i++)
    	n[i] = sc.nextInt();
    
    for(int i = 0; i < N; i++){
    	x = i;
    	for(int j = i; j < N; j++){
    		if(n[j] < n[x])
    			x = j;
    	}
    		
    	if(i != x){
    		y = n[i];
    		n[i] = n[x];
    		n[x] = y;
    		count++;
    	}	
    }
    for(int i = 0; i < N; i++)
    	if(i != N - 1)
    		System.out.print(n[i] + " ");
    	else
    		System.out.println(n[i]);
    
    System.out.println(count);
    
    sc.close();
  }
}