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 

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Set;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author praveen123
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskB solver = new TaskB();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskB {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            int[] a = new int[n];
            for (int i = 0; i < n; i++) {
                a[i] = in.nextInt();
                a[i]--;
            }
            Graph graph = new Graph(n);
            for (int i = 0; i < n; i++) {
                graph.addEdge(i, a[i]);
                graph.addEdge(a[i], i);
            }
            int ans = graph.countComponents() - 1;
            boolean[] visited = new boolean[n];
            List<Integer> verts = graph.collectVerticesFromDistinctComponents();
            List<Integer> goodVerts = new ArrayList<>();
            for (int x : verts) {
                int cur = x;
                while (!visited[cur]) {
                    visited[cur] = true;
                    cur = a[cur];
                }
                goodVerts.add(cur);
            }
            boolean found = false;
            for (int i = 0; i < goodVerts.size(); i++) {
                if (a[goodVerts.get(i)] == goodVerts.get(i)) {
                    found = true;
                    int temp = goodVerts.get(i);
                    goodVerts.set(i, goodVerts.get(goodVerts.size() - 1));
                    goodVerts.set(goodVerts.size() - 1, temp);
                    break;
                }
            }
            int[] b = new int[n];
            for (int i = 0; i < n; i++) {
                b[i] = a[i];
            }
            for (int i = 0; i + 1 < goodVerts.size(); i++) {
                b[goodVerts.get(i)] = goodVerts.get(i + 1);
            }
            if (!found) {
                ans++;
            }
            b[goodVerts.get(goodVerts.size() - 1)] = goodVerts.get(goodVerts.size() - 1);
            System.out.println(ans);
            for (int i = 0; i < n; i++) {
                System.out.print(b[i] + 1);
                if (i + 1 < n) {
                    System.out.print(" ");
                }
            }
            System.out.println();
        /*
        DirectedGraph newGraph = new DirectedGraph(n);
        int root = 0;
        for (int i = 0; i < n; i++) {
            newGraph.addEdge(b[i], i);
            if (b[i] == i) {
                root = i;
            }
        }
        newGraph.dfs(root);
        if (!newGraph.checkAllVisited()) {
            throw new RuntimeException("Bad stuff");
        }
        */
        }

        class Graph {
            List<List<Integer>> g;
            int[] visited;
            int n;
            int comp = 1;

            Graph() {

            }

            Graph(int n) {
                this.n = n;
                g = new ArrayList<>();
                for (int i = 0; i < n; i++) {
                    g.add(new ArrayList<>());
                }
                visited = new int[n];
            }

            void addEdge(int from, int to) {
                g.get(from).add(to);
                g.get(to).add(from);
            }

            int countComponents() {
                int ans = 0;
                for (int i = 0; i < n; i++) {
                    if (visited[i] == 0) {
                        dfs(i);
                        ans++;
                        comp++;
                    }
                }
                return ans;
            }

            private void dfs(int from) {
                visited[from] = comp;
                for (int to : g.get(from)) {
                    if (visited[to] == 0) {
                        dfs(to);
                    }
                }
            }

            List<Integer> collectVerticesFromDistinctComponents() {
                Set<Integer> usedComponents = new HashSet<>();
                List<Integer> res = new ArrayList<>();
                for (int i = 0; i < n; i++) {
                    if (!usedComponents.contains(visited[i])) {
                        usedComponents.add(visited[i]);
                        res.add(i);
                    }
                }
                return res;
            }

        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
}

