#include <iostream>
#include <cstring>
using namespace std;
int main()
{
	int i,j,k,n,m;
	int a[105];
	while(cin>>n)
	{
		for(i=0;i<n;i++)
			cin>>a[i];
		m=0;
		for(i=0;i<n-1;i++)
		{
			k=i;
			for(j=i+1;j<n;j++)
				if(a[j]<a[k])
					k=j;
			if(k!=i)
			{
				swap(a[k],a[i]);
				m++;
			}
		}
		for(i=0;i<n-1;i++)
			cout<<a[i]<<" ";
		cout<<a[n-1]<<endl<<m<<endl;
	}	
}

### Prompt

In Cpp, your task is to solve the following problem:

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

### Response

```cpp
#include <iostream>
#include <cstring>
using namespace std;
int main()
{
	int i,j,k,n,m;
	int a[105];
	while(cin>>n)
	{
		for(i=0;i<n;i++)
			cin>>a[i];
		m=0;
		for(i=0;i<n-1;i++)
		{
			k=i;
			for(j=i+1;j<n;j++)
				if(a[j]<a[k])
					k=j;
			if(k!=i)
			{
				swap(a[k],a[i]);
				m++;
			}
		}
		for(i=0;i<n-1;i++)
			cout<<a[i]<<" ";
		cout<<a[n-1]<<endl<<m<<endl;
	}	
}

```