output_description: 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.
input_description: 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.
attempt: count = int(input())
  data = [int(n) for n in input().split(" ")]
  
  
  def selection_sort(data):
      count = len(data)
      o = 0
      for i in range(count):
          minI = i
          for j in range(i + 1, count):
              if data[j] < data[minI]:
                  minI = j
          if minI != i:
              temp = data[i]
              data[i] = data[minI]
              data[minI] = temp
              o += 1
      show(data)
      print(o)
  
  
  def show(data):
      print(" ".join(str(n) for n in data))
  
  
  selection_sort(data)
  
problem_description: 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.
samples: [{"input": "6\n    5 6 4 2 1 3", "output": "1 2 3 4 5 6\n    4"}, {"input": "6\n    5 2 4 6 1 3", "output": "1 2 3 4 5 6\n    3"}]