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.

Input

The first line of the input includes an integer N, the number of elements in the sequence.

In the second line, N

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.

Constraints

1 ≤ N ≤ 100

Sample Input 1

6
5 6 4 2 1 3

Sample Output 1

1 2 3 4 5 6
4

Sample Input 2

6
5 2 4 6 1 3

Sample Output 2

1 2 3 4 5 6
3

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
const int maxn=105;
int n;
int a[maxn];
void SelectSort ()
{
    int sum=0;
    for (int i=0;i<n-1;i++)
        {
            int temp=a[i];
            int loc=i;
            for (int j=i+1;j<n;j++)
                if(a[j]<temp)
                    {
                        temp=a[j];
                        loc=j;
                    }
            if(loc!=i)
            {
                a[loc]=a[i];
                a[i]=temp;
                sum++;
            }
        }

    for (int i=0;i<n;i++)
        printf("%d%c",a[i],i==n-1? '\n':' ');
    printf("%d\n",sum);
}
int main()
{
    scanf("%d",&n);
    for (int i=0;i<n;i++)
        scanf("%d",&a[i]);
    SelectSort();
    return 0;
}