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 {
	private static int selectionSort(int a[]) {
		int cnt = 0;
		for (int i = 0; i < a.length - 1; ++i) {
			int min = i;
			for (int j = i + 1; j < a.length; ++j) {
				if (a[j] < a[min])
					min = j;
			}
			if (min != i) {
				int t = a[min];
				a[min] = a[i];
				a[i] = t;
				cnt++;
			}
		}
		return cnt;
	}
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();
		int[] a = new int[n];
		for (int i = 0; i < n; ++i)
			a[i] = scan.nextInt();
		int cnt = selectionSort(a);
		for (int t = 0; t < a.length; ++t) {
			System.out.print(a[t]);
			if (t != a.length - 1) 
				System.out.print(" ");
		}
		System.out.println();
		System.out.println(cnt);
	}
//	public static void main(int a) {
//		
//	}
}

