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
#include<iostream>
using namespace std;
int main()
{	int A[100],n,i=0,j,key,change=0,change_2;
	cin>>n;
	while(i<n)
		cin>>A[i++];
	for(i=0;i<n;i++)
	{	key=i;
		for(j=i;j<n;j++)
		{	if(A[j]<A[key])
				key=j;
		}
		if(i!=key)
		{	change_2=A[i],A[i]=A[key];
			A[key]=change_2,change++;
		}	
	}
	for(i=0;i<n;i++)
	{	cout<<A[i];	
		if(i!=n-1)
			cout<<" ";
	}
	cout<<endl;
	cout<<change<<endl;
		
}
