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 JAVA (judge verdict: Accepted)

import java.util.*;

public class Main {
	
	public static void main(String[] args) {
		Scanner in=new Scanner(System.in);
		 int n=in.nextInt();
		 List<Integer> A=new ArrayList<>();
		 
		 for(int i=0;i<n;i++)A.add(Integer.parseInt(in.next()));
		 in.close();
		 
		 int swap=selection(A);
		 for(int i=0;i<n-1;i++)System.out.print(A.get(i)+" ");
		 System.out.println(A.get(n-1));
		 System.out.println(swap);
	}
	
	static int selection(List<Integer> A) {
		int sw=0;
		
		for(int i=0;i<A.size();i++) {
			int min=i;
			for(int j=i;j<A.size();j++) {
				if(A.get(j)<A.get(min))min=j;
			}
			
			if(min>i) {
				Collections.swap(A, i, min);
				sw++;
			}
			
		}
		
		return sw;
	}
}