#include<iostream>
using namespace std;

int main(){

  int n,a[100];
  int min,tmp,sum=0;

  cin >> n;
  for(int i=0; i<n; i++)
    cin >> a[i];


  for(int i=0; i<n; i++){
    min = i;
    for(int j=i; j<n; j++){
      if(a[j] < a[min])
	min = j;
    }

    if(min!=i){
      tmp = a[i];
      a[i] = a[min];
      a[min] = tmp;
      sum++;
    }

  }
   
  cout << a[0];
  for(int i=1; i<n; i++)
    cout << ' ' <<a[i];

  cout << endl << sum << endl;


  return 0;
}
### Prompt

Develop a solution in CPP to the problem described below:

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>
using namespace std;

int main(){

  int n,a[100];
  int min,tmp,sum=0;

  cin >> n;
  for(int i=0; i<n; i++)
    cin >> a[i];


  for(int i=0; i<n; i++){
    min = i;
    for(int j=i; j<n; j++){
      if(a[j] < a[min])
	min = j;
    }

    if(min!=i){
      tmp = a[i];
      a[i] = a[min];
      a[min] = tmp;
      sum++;
    }

  }
   
  cout << a[0];
  for(int i=1; i<n; i++)
    cout << ' ' <<a[i];

  cout << endl << sum << endl;


  return 0;
}
```