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){
        int[] a,b;
        a = new int[101];
        b = new int[101];
        Scanner s = new Scanner(System.in);
        int n = s.nextInt();
        int i,j,t,now=111,co=0,nowt=-1;
        for(i=0;i<n;i++)a[i] = s.nextInt();
        for(i=0;i<n;i++){
            for(j=i;j<n;j++){
                if(now>a[j]){
                    now=a[j];
                    nowt = j;
                }
            }
            if(a[i]!=now&&nowt>=0){
                t = a[nowt];
                a[nowt] = a[i];
                a[i]=t;
                co++;
            }
            now=111;
        }
        for(i=0;i<n;i++){
            if(i==0)System.out.print(a[i]);
            else System.out.print(" "+a[i]);
        }
        System.out.println();
        System.out.println(co);


    }
}
