#include<cstdio>
int main(){
	int n=0,a[125],count=0,mini=0;
	scanf("%d", &n);
	for(int i=0;i<n;i++){
		scanf("%d", &a[i]);
	}
	for(int i=0;i<n-1;i++){
		mini=i ;
		for(int j=i;j<n;j++)
			if(a[j]<a[mini])mini=j;
				if(i!=mini){
				int b=a[i];
				a[i]=a[mini];
				a[mini]=b;
				count++;	
			}
		}
    
	for(int i=0;i<n;i++){
		if(i)printf(" ");
		printf("%d",a[i]);
	}
	printf("\n%d\n",count);
	return 0;
} 
### Prompt

Please create a solution in Cpp to 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<cstdio>
int main(){
	int n=0,a[125],count=0,mini=0;
	scanf("%d", &n);
	for(int i=0;i<n;i++){
		scanf("%d", &a[i]);
	}
	for(int i=0;i<n-1;i++){
		mini=i ;
		for(int j=i;j<n;j++)
			if(a[j]<a[mini])mini=j;
				if(i!=mini){
				int b=a[i];
				a[i]=a[mini];
				a[mini]=b;
				count++;	
			}
		}
    
	for(int i=0;i<n;i++){
		if(i)printf(" ");
		printf("%d",a[i]);
	}
	printf("\n%d\n",count);
	return 0;
} 
```