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

#!/usr/bin/ruby
# -*- coding: utf-8 -*-
class Main
  def initialize()
    #fh = open("x.txt")
    fh = STDIN
    n = fh.gets.chomp.to_i
    count=0
    fl = fh.gets.chomp.split.map{|x| x.to_i}
    abort if fl.length != n

    ans = insertion(fl)
    n = ans.shift
    puts ans.map{|x|x.to_s}.join(" ")
    puts n
  end

  def insertion(a)
    n = 0
    0.upto(a.length-1).each{|i|
      mini = i
      i.upto(a.length-1).each{|j|
        if a[j] < a[mini] then
          mini = j
        end
      }
      if i != mini then
        tmp = a[i]
        a[i] = a[mini]
        a[mini] = tmp
        n += 1
      end
    }
    a.unshift(n)
  end
end

if $0==__FILE__ then
  Main.new()
end