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;

namespace ALDS_1_2_B
{
    class Program
    {
        static void Main(string[] args)
        {
            var itemNum = int.Parse(Console.ReadLine());
            var numArray = Console.ReadLine().Split(' ').Select(x => int.Parse(x));
            var result = SelectionSort(numArray);
        }

        static List<T> SelectionSort<T>(IEnumerable<T> target) where T : IComparable
        {
            var result = new List<T>(target);
            var exchangeCount = 0;
            for (int i = 0; i < result.Count - 1; i++)
            {
                var minPos = i;
                for (int j = i + 1; j < result.Count; j++)
                {
                    if (result[j].CompareTo(result[minPos]) < 0)
                    {
                        minPos = j;
                    }
                }

                if(i == minPos)
                {
                    continue;
                }

                var min = result[minPos];
                result[minPos] = result[i];
                result[i] = min;
                exchangeCount++;
            }
            Console.WriteLine(string.Join(" ", result));
            Console.WriteLine(exchangeCount);
            return result;
        }
    }
}