import java.util.Scanner;

public class Main
{
	static int selectionSort(int A[], int n)
	{
		int ret = 0;
		for (int i = 0; i < n; i++)
		{
			int minj = i;
			for (int j = i; j < n; j++)
			{
				if(A[j] < A[minj])
				{
					minj = j;
				}
			}
			if(minj != i)
			{
				int temp = A[i];
				A[i] = A[minj];
				A[minj] = temp;
				++ret;
			}
		}
		return ret;
	}
	public static void main(String args[])
	{
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int A[] = new int[n];
		for (int i = 0; i < n; i++)
		{
			A[i] = sc.nextInt();
		}
		int ans = selectionSort(A, n);
		for (int i = 0; i < n; i++)
		{
			System.out.print(A[i]);
			if(i < n - 1)
			{
				System.out.print(" ");
			}
		}
		System.out.println("\n" + ans);
		sc.close();
	}
}

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz