3
2 1 1
 6
6 2 6 2 4 2
 2
1 2
 8
2 1 2 2 6 5 6 6
 18
2 3 4 5 2 7 8 9 10 7 11 12 14 15 13 17 18 18
 7
1 2 3 4 5 6 7
 7
4 3 2 6 3 5 2
 7
7 5 3 1 2 1 5
 7
1 6 4 4 5 6 7

1
2 2 1  0
6 2 6 2 4 2  1 
1 1 
 2 
2 2 2 2 6 2 6 6 
 5 
2 3 4 5 11 7 8 9 10 11 11 11 14 15 11 17 18 11 
 6 
1 1 1 1 1 1 1 
 1
4 3 3 6 3 5 2  1
7 5 3 1 3 1 5  4 
1 6 4 1 1 1 1 

/*
Keep solving problems.
*/

import java.util.*;
import java.io.*;

public class CFA {
    BufferedReader br;
    PrintWriter out;
    StringTokenizer st;
    boolean eof;
    private static final long MOD = 1000 * 1000 * 1000 + 7;
    private static final int[] dx = {0, -1, 0, 1};
    private static final int[] dy = {1, 0, -1, 0};
    private static final String yes = "Yes";
    private static final String no = "No";

    int n;
    List<List<Integer>> graph = new ArrayList<>();
    List<List<Integer>> comp = new ArrayList<>();
    boolean[] vis;
    int[] arr;
    void solve() throws IOException {
        n = nextInt();
        for (int i = 0; i < n; i++) {
            graph.add(new ArrayList<>());
        }
        arr = nextIntArr(n);
        for (int i = 0; i < n; i++) {
            int u = i;
            int v = arr[i] - 1;
            if (u != v) {
                graph.get(u).add(v);
                graph.get(v).add(u);
            }
        }

        int same = 0;
        for (int i = 0; i < n; i++) {
            if (i == arr[i] - 1) {
                same++;
            }
        }

        vis = new boolean[n];
        for (int i = 0; i < n; i++) {
            if (!vis[i]) {
                List<Integer> ls = new ArrayList<>();
                findComp(i, ls, -1);
                comp.add(ls);
            }
        }

        Arrays.fill(vis, false);
        List<Integer> roots = new ArrayList<>();
        for (List<Integer> com : comp) {
            roots.add(findRoot(com));
        }

        if (comp.size() == 1) {
            if (same == 1) {
                outln(0);
                for (int i = 0; i < n; i++) {
                    out(arr[i] + " ");
                }
                return;
            }
        }

        int[] res = Arrays.copyOf(arr, n);
        int cnt = 0;
        int root = -1;
        for (int v : roots) {
            if (v == arr[v] - 1) {
                root = v;
            }
        }

        if (root == -1) {
            root = roots.get(0);
            if (root != arr[root] - 1) {
                cnt++;
                res[root] = root + 1;
            }
            for (int i = 0; i < roots.size(); i++) {
                int cur = roots.get(i);
                if (cur != root) {
                    cnt++;
                    res[cur] = root + 1;
                }
            }

            outln(cnt);
            for (int i = 0; i < n; i++) {
                out(res[i] + " ");
            }

            return;
        }

        for (int v : roots) {
            if (v != root) {
                cnt++;
                res[v] = root + 1;
            }
        }

        outln(cnt);
        for (int i = 0; i < n; i++) {
            out(res[i] + " ");
        }
    }

    int findRoot(List<Integer> com) {
        int start = com.get(0);
        while (true) {
            if (vis[start]) {
                break;
            }

            vis[start] = true;
            start = arr[start] - 1;
        }

        return start;
    }

    void findComp(int cur, List<Integer> ls, int parent) {
        if (vis[cur]) {
            return;
        }

        ls.add(cur);
        vis[cur] = true;
        for (int nxt : graph.get(cur)) {
            if (nxt == parent) {
                continue;
            }
            findComp(nxt, ls, cur);
        }
    }

    void shuffle(int[] a) {
        int n = a.length;
        for(int i = 0; i < n; i++) {
            int r = i + (int) (Math.random() * (n - i));
            int tmp = a[i];
            a[i] = a[r];
            a[r] = tmp;
        }
    }

    long gcd(long a, long b) {
        while(a != 0 && b != 0) {
            long c = b;
            b = a % b;
            a = c;
        }
        return a + b;
    }

    private void outln(Object o) {
        out.println(o);
    }
    private void out(Object o) {
        out.print(o);
    }
    private void formatPrint(double val) {
        System.out.format("%.9f%n", val);
    }
    public CFA() throws IOException {
        br = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);
        solve();
        out.close();
    }
    public static void main(String[] args) throws IOException {
        new CFA();
    }

    public long[] nextLongArr(int n) throws IOException{
        long[] res = new long[n];
        for(int i = 0; i < n; i++)
            res[i] = nextLong();
        return res;
    }
    public int[] nextIntArr(int n) throws IOException {
        int[] res = new int[n];
        for(int i = 0; i < n; i++)
            res[i] = nextInt();
        return res;
    }
    public String nextToken() {
        while (st == null || !st.hasMoreTokens()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (Exception e) {
                eof = true;
                return null;
            }
        }
        return st.nextToken();
    }
    public String nextString() {
        try {
            return br.readLine();
        } catch (IOException e) {
            eof = true;
            return null;
        }
    }
    public int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }
    public long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }
    public double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }
}