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

list_size = input()                                                                                                                                                                                         
list_str = input()                                                                                                                                                                                          
val_list = list(map(int, list_str.split()))                                                                                                                                                                 
                                                                                                                                                                                                            
def where_is_the_first_lowest_val(List):                                                                                                                                                                    
    return List.index(min(List))                                                                                                                                                                            
                                                                                                                                                                                                            
def swap(idx_num, lowest_val_index, List):                                                                                                                                                                  
    val = List[idx_num]                                                                                                                                                                                     
    List[idx_num] = List[lowest_val_index + idx_num]                                                                                                                                                        
    List[lowest_val_index + idx_num] = val                                                                                                                                                                  
                                                                                                                                                                                                            
swap_num = 0                                                                                                                                                                                                
for idx_num in range(0, int(list_size) - 1):                                                                                                                                                                
    unsorted_list = val_list[idx_num : int(list_size)]                                                                                                                                                      
    lowest_val_index = where_is_the_first_lowest_val(unsorted_list)                                                                                                                                         
    if val_list[idx_num] != val_list[lowest_val_index + idx_num]: swap(idx_num, lowest_val_index, val_list) ; swap_num += 1                                                                                 
                                                                                                                                                                                                            
str_list = list(map(str, val_list))                                                                                                                                                                         
str_list = ','.join(str_list).replace(',', ' ')                                                                                                                                                             
print(str_list)                                                                                                                                                                                             
print(swap_num)