Problem:
Selection Sort

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 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.

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

Solution in C# (judge verdict: Accepted)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;


class data
{
    public int input;
    public int position;

};
namespace ConsoleApplication3
{
    class Program
    {

        static void Main(string[] args)
        {
            string temp;
            string[] data;
            int[] result;
            int number;
            int swap = 0,count=0,mini;

            temp = Console.ReadLine();
            number = int.Parse(temp);
            result = new int[number];

            data = new string[number];
            temp = Console.ReadLine();
            data = temp.Split(' ');
            for (int i = 0; i < number; i++)
                result[i] = int.Parse(data[i]);
           
            for (int i = 0; i < number; i++)
            {
                mini = i;
                for (int j = i; j <number; j++)
                {
                    if (result[j] < result[mini])
                    {
                        mini = j;
                    }
                }
                if (i != mini)
                {
                    count++;
                    swap = result[i];
                    result[i] = result[mini];
                    result[mini] = swap;
                }

            }


            Console.WriteLine(string.Join(" ", result));
            Console.WriteLine("{0}",count);
        }
    }
}