#include <stdio.h>
#define N 100


int selection(int A[N], int n){
 // N個の要素を含む0-オリジンの配列A

	int i,j,mini, minj,count=0,tmp;

	for(i = 0; i < n-1; i++){
		minj = i;
		for(j = i+1; j < n; j++){
			if(A[j] < A[minj]) minj = j;
		}

		tmp = A[i];
		A[i] = A[minj];
		A[minj] = tmp;
		count++;
	}
	return count;
}


int main(){

	int A[N],n,i,count;

	scanf("%d",&n);

	for(i = 0; i < n; i++){
		scanf("%d",&A[i]);
	}

	count = selection(A,n);

	for ( i = 0; i < n; ++i){
		printf("%d",A[i]);
		if( i != n-1) printf(" ");
	}
	printf("\n%d\n",count);

	return 0;
}
