import java.util.Scanner;

public class Main {

    static int selectionSort(int A[],int N){
        int count = 0;
        for (int i = 0; i<N-1;i++){
            int minj = i;
            for (int j = i;j<N;j++){
                if (A[j]<A[minj])
                {
                    minj = j;
                }
            }
            int temp = A[i];
            A[i] = A[minj];
            A[minj] = temp;
            if (i!= minj){ count++;}
        }
        return count;
    }


    public static void main(String[]args){
       int A[] = new int[100];
        int count = 0;
        Scanner scanner = new Scanner(System.in);
        int N = scanner.nextInt();
        for (int i = 0; i<N; i++){
            A[i] = scanner.nextInt();
        }
        count = selectionSort(A,N);

        for (int i = 0; i<N; i++){
            if (i>0){
                System.out.print(" ");
            }
            System.out.print(A[i]);
        }
        System.out.println();
        System.out.println(count);
    }
}
 import java.util.Scanner; Scanner java.util public class Main {

    static int selectionSort(int A[],int N){
        int count = 0;
        for (int i = 0; i<N-1;i++){
            int minj = i;
            for (int j = i;j<N;j++){
                if (A[j]<A[minj])
                {
                    minj = j;
                }
            }
            int temp = A[i];
            A[i] = A[minj];
            A[minj] = temp;
            if (i!= minj){ count++;}
        }
        return count;
    }


    public static void main(String[]args){
       int A[] = new int[100];
        int count = 0;
        Scanner scanner = new Scanner(System.in);
        int N = scanner.nextInt();
        for (int i = 0; i<N; i++){
            A[i] = scanner.nextInt();
        }
        count = selectionSort(A,N);

        for (int i = 0; i<N; i++){
            if (i>0){
                System.out.print(" ");
            }
            System.out.print(A[i]);
        }
        System.out.println();
        System.out.println(count);
    }
} Main static int selectionSort(int A[],int N){
        int count = 0;
        for (int i = 0; i<N-1;i++){
            int minj = i;
            for (int j = i;j<N;j++){
                if (A[j]<A[minj])
                {
                    minj = j;
                }
            }
            int temp = A[i];
            A[i] = A[minj];
            A[minj] = temp;
            if (i!= minj){ count++;}
        }
        return count;
    } selectionSort {
        int count = 0;
        for (int i = 0; i<N-1;i++){
            int minj = i;
            for (int j = i;j<N;j++){
                if (A[j]<A[minj])
                {
                    minj = j;
                }
            }
            int temp = A[i];
            A[i] = A[minj];
            A[minj] = temp;
            if (i!= minj){ count++;}
        }
        return count;
    } int count = 0; count 0 for (int i = 0; i<N-1;i++){
            int minj = i;
            for (int j = i;j<N;j++){
                if (A[j]<A[minj])
                {
                    minj = j;
                }
            }
            int temp = A[i];
            A[i] = A[minj];
            A[minj] = temp;
            if (i!= minj){ count++;}
        } int i = 0; int i = 0; i 0 i<N-1 i N-1 N 1 i++ i++ i {
            int minj = i;
            for (int j = i;j<N;j++){
                if (A[j]<A[minj])
                {
                    minj = j;
                }
            }
            int temp = A[i];
            A[i] = A[minj];
            A[minj] = temp;
            if (i!= minj){ count++;}
        } {
            int minj = i;
            for (int j = i;j<N;j++){
                if (A[j]<A[minj])
                {
                    minj = j;
                }
            }
            int temp = A[i];
            A[i] = A[minj];
            A[minj] = temp;
            if (i!= minj){ count++;}
        } int minj = i; minj i for (int j = i;j<N;j++){
                if (A[j]<A[minj])
                {
                    minj = j;
                }
            } int j = i; int j = i; j i j<N j N j++ j++ j {
                if (A[j]<A[minj])
                {
                    minj = j;
                }
            } {
                if (A[j]<A[minj])
                {
                    minj = j;
                }
            } if (A[j]<A[minj])
                {
                    minj = j;
                } A[j]<A[minj] A[j] A j A[minj] A minj {
                    minj = j;
                } minj = j minj j int temp = A[i]; temp A[i] A i A[i] = A[minj] A[i] A i A[minj] A minj A[minj] = temp A[minj] A minj temp if (i!= minj){ count++;} i!= minj i minj { count++;} count++ count return count; count int A[] A int N N public static void main(String[]args){
       int A[] = new int[100];
        int count = 0;
        Scanner scanner = new Scanner(System.in);
        int N = scanner.nextInt();
        for (int i = 0; i<N; i++){
            A[i] = scanner.nextInt();
        }
        count = selectionSort(A,N);

        for (int i = 0; i<N; i++){
            if (i>0){
                System.out.print(" ");
            }
            System.out.print(A[i]);
        }
        System.out.println();
        System.out.println(count);
    } main {
       int A[] = new int[100];
        int count = 0;
        Scanner scanner = new Scanner(System.in);
        int N = scanner.nextInt();
        for (int i = 0; i<N; i++){
            A[i] = scanner.nextInt();
        }
        count = selectionSort(A,N);

        for (int i = 0; i<N; i++){
            if (i>0){
                System.out.print(" ");
            }
            System.out.print(A[i]);
        }
        System.out.println();
        System.out.println(count);
    } int A[] = new int[100]; A new int[100] 100 int count = 0; count 0 Scanner scanner = new Scanner(System.in); scanner new Scanner(System.in) int N = scanner.nextInt(); N scanner.nextInt() scanner.nextInt scanner for (int i = 0; i<N; i++){
            A[i] = scanner.nextInt();
        } int i = 0; int i = 0; i 0 i<N i N i++ i++ i {
            A[i] = scanner.nextInt();
        } {
            A[i] = scanner.nextInt();
        } A[i] = scanner.nextInt() A[i] A i scanner.nextInt() scanner.nextInt scanner count = selectionSort(A,N) count selectionSort(A,N) selectionSort A N for (int i = 0; i<N; i++){
            if (i>0){
                System.out.print(" ");
            }
            System.out.print(A[i]);
        } int i = 0; int i = 0; i 0 i<N i N i++ i++ i {
            if (i>0){
                System.out.print(" ");
            }
            System.out.print(A[i]);
        } {
            if (i>0){
                System.out.print(" ");
            }
            System.out.print(A[i]);
        } if (i>0){
                System.out.print(" ");
            } i>0 i 0 {
                System.out.print(" ");
            } System.out.print(" ") System.out.print System.out System System.out " " System.out.print(A[i]) System.out.print System.out System System.out A[i] A i System.out.println() System.out.println System.out System System.out System.out.println(count) System.out.println System.out System System.out count String[]args args public class Main {

    static int selectionSort(int A[],int N){
        int count = 0;
        for (int i = 0; i<N-1;i++){
            int minj = i;
            for (int j = i;j<N;j++){
                if (A[j]<A[minj])
                {
                    minj = j;
                }
            }
            int temp = A[i];
            A[i] = A[minj];
            A[minj] = temp;
            if (i!= minj){ count++;}
        }
        return count;
    }


    public static void main(String[]args){
       int A[] = new int[100];
        int count = 0;
        Scanner scanner = new Scanner(System.in);
        int N = scanner.nextInt();
        for (int i = 0; i<N; i++){
            A[i] = scanner.nextInt();
        }
        count = selectionSort(A,N);

        for (int i = 0; i<N; i++){
            if (i>0){
                System.out.print(" ");
            }
            System.out.print(A[i]);
        }
        System.out.println();
        System.out.println(count);
    }
} public class Main {

    static int selectionSort(int A[],int N){
        int count = 0;
        for (int i = 0; i<N-1;i++){
            int minj = i;
            for (int j = i;j<N;j++){
                if (A[j]<A[minj])
                {
                    minj = j;
                }
            }
            int temp = A[i];
            A[i] = A[minj];
            A[minj] = temp;
            if (i!= minj){ count++;}
        }
        return count;
    }


    public static void main(String[]args){
       int A[] = new int[100];
        int count = 0;
        Scanner scanner = new Scanner(System.in);
        int N = scanner.nextInt();
        for (int i = 0; i<N; i++){
            A[i] = scanner.nextInt();
        }
        count = selectionSort(A,N);

        for (int i = 0; i<N; i++){
            if (i>0){
                System.out.print(" ");
            }
            System.out.print(A[i]);
        }
        System.out.println();
        System.out.println(count);
    }
} Main
import java.util.Scanner;

public class Main {

    static int selectionSort(int A[],int N){
        int count = 0;
        for (int i = 0; i<N-1;i++){
            int minj = i;
            for (int j = i;j<N;j++){
                if (A[j]<A[minj])
                {
                    minj = j;
                }
            }
            int temp = A[i];
            A[i] = A[minj];
            A[minj] = temp;
            if (i!= minj){ count++;}
        }
        return count;
    }


    public static void main(String[]args){
       int A[] = new int[100];
        int count = 0;
        Scanner scanner = new Scanner(System.in);
        int N = scanner.nextInt();
        for (int i = 0; i<N; i++){
            A[i] = scanner.nextInt();
        }
        count = selectionSort(A,N);

        for (int i = 0; i<N; i++){
            if (i>0){
                System.out.print(" ");
            }
            System.out.print(A[i]);
        }
        System.out.println();
        System.out.println(count);
    }
}

