import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        StringBuilder bd = new StringBuilder();

        int N = sc.nextInt();
        int[] A = new int[N];
        for (int i=0; i<N; i++) {
            A[i] = sc.nextInt();
        }

        int counter = selectionSort(A, N);
        for (int i=0; i<N-1; i++) {
            System.out.print(A[i] + " ");
        }
        System.out.println(A[N-1]);
        System.out.println(counter);
    }

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


    public static int bubbleSort(int[] A, int N) {
        int flag = 1;
        int count = 0;
        while (flag == 1) {
            flag = 0;
            for (int i=N-1; i>=1; i--) {
                if (A[i] < A[i-1]) {
                    int t = A[i];
                    A[i] = A[i-1];
                    A[i-1] = t;
                    flag = 1;
                    count++;
                }
            }
        }
        return count;
    }
} import java.util.*; util.* java public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        StringBuilder bd = new StringBuilder();

        int N = sc.nextInt();
        int[] A = new int[N];
        for (int i=0; i<N; i++) {
            A[i] = sc.nextInt();
        }

        int counter = selectionSort(A, N);
        for (int i=0; i<N-1; i++) {
            System.out.print(A[i] + " ");
        }
        System.out.println(A[N-1]);
        System.out.println(counter);
    }

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


    public static int bubbleSort(int[] A, int N) {
        int flag = 1;
        int count = 0;
        while (flag == 1) {
            flag = 0;
            for (int i=N-1; i>=1; i--) {
                if (A[i] < A[i-1]) {
                    int t = A[i];
                    A[i] = A[i-1];
                    A[i-1] = t;
                    flag = 1;
                    count++;
                }
            }
        }
        return count;
    }
} Main public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        StringBuilder bd = new StringBuilder();

        int N = sc.nextInt();
        int[] A = new int[N];
        for (int i=0; i<N; i++) {
            A[i] = sc.nextInt();
        }

        int counter = selectionSort(A, N);
        for (int i=0; i<N-1; i++) {
            System.out.print(A[i] + " ");
        }
        System.out.println(A[N-1]);
        System.out.println(counter);
    } main {
        Scanner sc = new Scanner(System.in);
        StringBuilder bd = new StringBuilder();

        int N = sc.nextInt();
        int[] A = new int[N];
        for (int i=0; i<N; i++) {
            A[i] = sc.nextInt();
        }

        int counter = selectionSort(A, N);
        for (int i=0; i<N-1; i++) {
            System.out.print(A[i] + " ");
        }
        System.out.println(A[N-1]);
        System.out.println(counter);
    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) StringBuilder bd = new StringBuilder(); bd new StringBuilder() int N = sc.nextInt(); N sc.nextInt() sc.nextInt sc int[] A = new int[N]; A new int[N] N for (int i=0; i<N; i++) {
            A[i] = sc.nextInt();
        } int i=0; int i=0; i 0 i<N i N i++ i++ i {
            A[i] = sc.nextInt();
        } {
            A[i] = sc.nextInt();
        } A[i] = sc.nextInt() A[i] A i sc.nextInt() sc.nextInt sc int counter = selectionSort(A, N); counter selectionSort(A, N) selectionSort A N for (int i=0; i<N-1; i++) {
            System.out.print(A[i] + " ");
        } int i=0; int i=0; i 0 i<N-1 i N-1 N 1 i++ i++ i {
            System.out.print(A[i] + " ");
        } {
            System.out.print(A[i] + " ");
        } System.out.print(A[i] + " ") System.out.print System.out System System.out A[i] + " " A[i] A i " " System.out.println(A[N-1]) System.out.println System.out System System.out A[N-1] A N-1 N 1 System.out.println(counter) System.out.println System.out System System.out counter String[] args args public static int selectionSort(int[] A, int N) {
        int minj = 0;
        int count = 0;
        for (int i=0; i<N; i++) {
            minj = i;
            for (int j=i; j<N; j++) {
                if (A[j] < A[minj])
                    minj = j;
            }
            if (i != minj) {
                int t = A[i];
                A[i] = A[minj];
                A[minj] = t;
                count++;
            }
        }
        return count;
    } selectionSort {
        int minj = 0;
        int count = 0;
        for (int i=0; i<N; i++) {
            minj = i;
            for (int j=i; j<N; j++) {
                if (A[j] < A[minj])
                    minj = j;
            }
            if (i != minj) {
                int t = A[i];
                A[i] = A[minj];
                A[minj] = t;
                count++;
            }
        }
        return count;
    } int minj = 0; minj 0 int count = 0; count 0 for (int i=0; i<N; i++) {
            minj = i;
            for (int j=i; j<N; j++) {
                if (A[j] < A[minj])
                    minj = j;
            }
            if (i != minj) {
                int t = A[i];
                A[i] = A[minj];
                A[minj] = t;
                count++;
            }
        } int i=0; int i=0; i 0 i<N i N i++ i++ i {
            minj = i;
            for (int j=i; j<N; j++) {
                if (A[j] < A[minj])
                    minj = j;
            }
            if (i != minj) {
                int t = A[i];
                A[i] = A[minj];
                A[minj] = t;
                count++;
            }
        } {
            minj = i;
            for (int j=i; j<N; j++) {
                if (A[j] < A[minj])
                    minj = j;
            }
            if (i != minj) {
                int t = A[i];
                A[i] = A[minj];
                A[minj] = t;
                count++;
            }
        } 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 if (i != minj) {
                int t = A[i];
                A[i] = A[minj];
                A[minj] = t;
                count++;
            } i != minj i minj {
                int t = A[i];
                A[i] = A[minj];
                A[minj] = t;
                count++;
            } int t = A[i]; t A[i] A i A[i] = A[minj] A[i] A i A[minj] A minj A[minj] = t A[minj] A minj t count++ count return count; count int[] A A int N N public static int bubbleSort(int[] A, int N) {
        int flag = 1;
        int count = 0;
        while (flag == 1) {
            flag = 0;
            for (int i=N-1; i>=1; i--) {
                if (A[i] < A[i-1]) {
                    int t = A[i];
                    A[i] = A[i-1];
                    A[i-1] = t;
                    flag = 1;
                    count++;
                }
            }
        }
        return count;
    } bubbleSort {
        int flag = 1;
        int count = 0;
        while (flag == 1) {
            flag = 0;
            for (int i=N-1; i>=1; i--) {
                if (A[i] < A[i-1]) {
                    int t = A[i];
                    A[i] = A[i-1];
                    A[i-1] = t;
                    flag = 1;
                    count++;
                }
            }
        }
        return count;
    } int flag = 1; flag 1 int count = 0; count 0 while (flag == 1) {
            flag = 0;
            for (int i=N-1; i>=1; i--) {
                if (A[i] < A[i-1]) {
                    int t = A[i];
                    A[i] = A[i-1];
                    A[i-1] = t;
                    flag = 1;
                    count++;
                }
            }
        } flag == 1 flag 1 {
            flag = 0;
            for (int i=N-1; i>=1; i--) {
                if (A[i] < A[i-1]) {
                    int t = A[i];
                    A[i] = A[i-1];
                    A[i-1] = t;
                    flag = 1;
                    count++;
                }
            }
        } flag = 0 flag 0 for (int i=N-1; i>=1; i--) {
                if (A[i] < A[i-1]) {
                    int t = A[i];
                    A[i] = A[i-1];
                    A[i-1] = t;
                    flag = 1;
                    count++;
                }
            } int i=N-1; int i=N-1; i N-1 N 1 i>=1 i 1 i-- i-- i {
                if (A[i] < A[i-1]) {
                    int t = A[i];
                    A[i] = A[i-1];
                    A[i-1] = t;
                    flag = 1;
                    count++;
                }
            } {
                if (A[i] < A[i-1]) {
                    int t = A[i];
                    A[i] = A[i-1];
                    A[i-1] = t;
                    flag = 1;
                    count++;
                }
            } if (A[i] < A[i-1]) {
                    int t = A[i];
                    A[i] = A[i-1];
                    A[i-1] = t;
                    flag = 1;
                    count++;
                } A[i] < A[i-1] A[i] A i A[i-1] A i-1 i 1 {
                    int t = A[i];
                    A[i] = A[i-1];
                    A[i-1] = t;
                    flag = 1;
                    count++;
                } int t = A[i]; t A[i] A i A[i] = A[i-1] A[i] A i A[i-1] A i-1 i 1 A[i-1] = t A[i-1] A i-1 i 1 t flag = 1 flag 1 count++ count return count; count int[] A A int N N public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        StringBuilder bd = new StringBuilder();

        int N = sc.nextInt();
        int[] A = new int[N];
        for (int i=0; i<N; i++) {
            A[i] = sc.nextInt();
        }

        int counter = selectionSort(A, N);
        for (int i=0; i<N-1; i++) {
            System.out.print(A[i] + " ");
        }
        System.out.println(A[N-1]);
        System.out.println(counter);
    }

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


    public static int bubbleSort(int[] A, int N) {
        int flag = 1;
        int count = 0;
        while (flag == 1) {
            flag = 0;
            for (int i=N-1; i>=1; i--) {
                if (A[i] < A[i-1]) {
                    int t = A[i];
                    A[i] = A[i-1];
                    A[i-1] = t;
                    flag = 1;
                    count++;
                }
            }
        }
        return count;
    }
} public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        StringBuilder bd = new StringBuilder();

        int N = sc.nextInt();
        int[] A = new int[N];
        for (int i=0; i<N; i++) {
            A[i] = sc.nextInt();
        }

        int counter = selectionSort(A, N);
        for (int i=0; i<N-1; i++) {
            System.out.print(A[i] + " ");
        }
        System.out.println(A[N-1]);
        System.out.println(counter);
    }

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


    public static int bubbleSort(int[] A, int N) {
        int flag = 1;
        int count = 0;
        while (flag == 1) {
            flag = 0;
            for (int i=N-1; i>=1; i--) {
                if (A[i] < A[i-1]) {
                    int t = A[i];
                    A[i] = A[i-1];
                    A[i-1] = t;
                    flag = 1;
                    count++;
                }
            }
        }
        return count;
    }
} Main
import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        StringBuilder bd = new StringBuilder();

        int N = sc.nextInt();
        int[] A = new int[N];
        for (int i=0; i<N; i++) {
            A[i] = sc.nextInt();
        }

        int counter = selectionSort(A, N);
        for (int i=0; i<N-1; i++) {
            System.out.print(A[i] + " ");
        }
        System.out.println(A[N-1]);
        System.out.println(counter);
    }

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


    public static int bubbleSort(int[] A, int N) {
        int flag = 1;
        int count = 0;
        while (flag == 1) {
            flag = 0;
            for (int i=N-1; i>=1; i--) {
                if (A[i] < A[i-1]) {
                    int t = A[i];
                    A[i] = A[i-1];
                    A[i-1] = t;
                    flag = 1;
                    count++;
                }
            }
        }
        return count;
    }
}
