import java.util.*;

public class Main {
    static void swap(int[] A, int i, int j) {
        int tmp = A[i];
        A[i] = A[j];
        A[j] = tmp;
    }

    static int selectionSort(int[] A, int N) {
        int count = 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(i != minj) {
                swap(A, i, minj);
                count++;
            }
        } 
        return count;
    }

    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 c = selectionSort(a, n);

        System.out.print(a[0]);
        for(int i = 1; i < n; i++) System.out.print(" " + a[i]);
        System.out.println();
        System.out.println(c);
    }
} import java.util.*; util.* java public class Main {
    static void swap(int[] A, int i, int j) {
        int tmp = A[i];
        A[i] = A[j];
        A[j] = tmp;
    }

    static int selectionSort(int[] A, int N) {
        int count = 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(i != minj) {
                swap(A, i, minj);
                count++;
            }
        } 
        return count;
    }

    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 c = selectionSort(a, n);

        System.out.print(a[0]);
        for(int i = 1; i < n; i++) System.out.print(" " + a[i]);
        System.out.println();
        System.out.println(c);
    }
} Main static void swap(int[] A, int i, int j) {
        int tmp = A[i];
        A[i] = A[j];
        A[j] = tmp;
    } swap {
        int tmp = A[i];
        A[i] = A[j];
        A[j] = tmp;
    } int tmp = A[i]; tmp A[i] A i A[i] = A[j] A[i] A i A[j] A j A[j] = tmp A[j] A j tmp int[] A A int i i int j j static int selectionSort(int[] A, int N) {
        int count = 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(i != minj) {
                swap(A, i, minj);
                count++;
            }
        } 
        return count;
    } selectionSort {
        int count = 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(i != minj) {
                swap(A, i, minj);
                count++;
            }
        } 
        return count;
    } int count = 0; count 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(i != minj) {
                swap(A, i, minj);
                count++;
            }
        } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
            int minj = i;
            for(int j = i; j < N; j++) {
                if(A[j] < A[minj]) minj = j;
            }
            if(i != minj) {
                swap(A, i, minj);
                count++;
            }
        } {
            int minj = i;
            for(int j = i; j < N; j++) {
                if(A[j] < A[minj]) minj = j;
            }
            if(i != minj) {
                swap(A, 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 if(i != minj) {
                swap(A, i, minj);
                count++;
            } i != minj i minj {
                swap(A, i, minj);
                count++;
            } swap(A, i, minj) swap A i minj count++ count return count; count int[] A A int N N 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 c = selectionSort(a, n);

        System.out.print(a[0]);
        for(int i = 1; i < n; i++) System.out.print(" " + a[i]);
        System.out.println();
        System.out.println(c);
    } main {
        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 c = selectionSort(a, n);

        System.out.print(a[0]);
        for(int i = 1; i < n; i++) System.out.print(" " + a[i]);
        System.out.println();
        System.out.println(c);
    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) 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] a i sc.nextInt() sc.nextInt sc int c = selectionSort(a, n); c selectionSort(a, n) selectionSort a n System.out.print(a[0]) System.out.print System.out System System.out a[0] a 0 for(int i = 1; i < n; i++) System.out.print(" " + a[i]); int i = 1; int i = 1; i 1 i < n i n i++ i++ 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() System.out.println System.out System System.out System.out.println(c) System.out.println System.out System System.out c String[] args args public class Main {
    static void swap(int[] A, int i, int j) {
        int tmp = A[i];
        A[i] = A[j];
        A[j] = tmp;
    }

    static int selectionSort(int[] A, int N) {
        int count = 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(i != minj) {
                swap(A, i, minj);
                count++;
            }
        } 
        return count;
    }

    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 c = selectionSort(a, n);

        System.out.print(a[0]);
        for(int i = 1; i < n; i++) System.out.print(" " + a[i]);
        System.out.println();
        System.out.println(c);
    }
} public class Main {
    static void swap(int[] A, int i, int j) {
        int tmp = A[i];
        A[i] = A[j];
        A[j] = tmp;
    }

    static int selectionSort(int[] A, int N) {
        int count = 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(i != minj) {
                swap(A, i, minj);
                count++;
            }
        } 
        return count;
    }

    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 c = selectionSort(a, n);

        System.out.print(a[0]);
        for(int i = 1; i < n; i++) System.out.print(" " + a[i]);
        System.out.println();
        System.out.println(c);
    }
} Main
import java.util.*;

public class Main {
    static void swap(int[] A, int i, int j) {
        int tmp = A[i];
        A[i] = A[j];
        A[j] = tmp;
    }

    static int selectionSort(int[] A, int N) {
        int count = 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(i != minj) {
                swap(A, i, minj);
                count++;
            }
        } 
        return count;
    }

    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 c = selectionSort(a, n);

        System.out.print(a[0]);
        for(int i = 1; i < n; i++) System.out.print(" " + a[i]);
        System.out.println();
        System.out.println(c);
    }
}
