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;

namespace Practice
{
    class Program
    {

        static void Main(string[] args)
        {
            SolveA(args);
            //SolveB(args);
            //SolveC(args);
            //SolveD(args);
        }


        static void SolveA(string[] args)
        {
            string sz = (Console.ReadLine());
            int n = int.Parse(sz);
            int[] a = new int[n];
            string[] szarr = Console.ReadLine().Split(' ');
            for(int i=0;i<szarr.Length;++i)
            {
                a[i] = int.Parse(szarr[i]);
            }

            selectionSort(a);

        }
        private static void selectionSort(int[] a)
        {
            int num = 0;
            for(int i=0;i<a.Length;++i)
            {
                int minj = i;
                for(int j=i;j<a.Length;++j)
                {
                    if( a[j] < a[minj])
                    {
                        minj = j;
                    }
                }
                if (i != minj)
                {
                    int tmp = a[i];
                    a[i] = a[minj];
                    a[minj] = tmp;
                    
                        num++;
                }
            }
            Writeline(a);
            Console.WriteLine(num);
        }
        private static void Writeline(int[] a)
        {
            string sz = "";
            for(int i=0;i<a.Length;++i)
            {
                sz += a[i];
                if( i < a.Length - 1)
                {
                    sz += " ";
                }
            }
            Console.WriteLine(sz);
        }
    }

}