Problem: A tree is an undirected connected graph without cycles.

Let's consider a rooted undirected tree with n vertices, numbered 1 through n. There are many ways to represent such a tree. One way is to create an array with n integers p1, p2, ..., pn, where pi denotes a parent of vertex i (here, for convenience a root is considered its own parent).

<image> For this rooted tree the array p is [2, 3, 3, 2].

Given a sequence p1, p2, ..., pn, one is able to restore a tree:

  1. There must be exactly one index r that pr = r. A vertex r is a root of the tree. 
  2. For all other n - 1 vertices i, there is an edge between vertex i and vertex pi. 



A sequence p1, p2, ..., pn is called valid if the described procedure generates some (any) rooted tree. For example, for n = 3 sequences (1,2,2), (2,3,1) and (2,1,3) are not valid.

You are given a sequence a1, a2, ..., an, not necessarily valid. Your task is to change the minimum number of elements, in order to get a valid sequence. Print the minimum number of changes and an example of a valid sequence after that number of changes. If there are many valid sequences achievable in the minimum number of changes, print any of them.

Input

The first line of the input contains an integer n (2 ≤ n ≤ 200 000) — the number of vertices in the tree.

The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ n).

Output

In the first line print the minimum number of elements to change, in order to get a valid sequence.

In the second line, print any valid sequence possible to get from (a1, a2, ..., an) in the minimum number of changes. If there are many such sequences, any of them will be accepted.

Examples

Input

4
2 3 3 4


Output

1
2 3 4 4 


Input

5
3 2 2 5 3


Output

0
3 2 2 5 3 


Input

8
2 3 5 4 1 6 6 7


Output

2
2 3 7 8 1 6 6 7

Note

In the first sample, it's enough to change one element. In the provided output, a sequence represents a tree rooted in a vertex 4 (because p4 = 4), which you can see on the left drawing below. One of other correct solutions would be a sequence 2 3 3 2, representing a tree rooted in vertex 3 (right drawing below). On both drawings, roots are painted red.

<image>

In the second sample, the given sequence is already valid.

Solution (in JAVA):

Solution:
import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;

/**
 * Created by darshan on 1/26/19.
 */
public class D699 {
    private static int[] graph;
    private static int[] tree;
    private static List<List<Integer>> adjList;

    private static boolean[] visited;

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
        StringTokenizer st;

        int n = Integer.parseInt(br.readLine());
        st = new StringTokenizer(br.readLine());
        int treeRoot = -1;
        graph = new int[n];
        tree = new int[n];
        for (int i = 0; i < n; i++) {
            graph[i] = Integer.parseInt(st.nextToken()) - 1;
            tree[i] = graph[i];
            if (i == graph[i]) {
                treeRoot = i;
            }
        }

        removeMultiEdges();
        adjList = new ArrayList<>(n);
        for (int i = 0; i < n; i++) {
            adjList.add(new ArrayList<>());
        }
        for (int node = 0; node < n; node++) {
            int parent = tree[node];
            // Avoid adding self loop in adjList when a root node is obtained
            if (node != parent) {
                adjList.get(node).add(parent);
                adjList.get(parent).add(node);
            }
        }

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

        /*
        If there is no existing root in the given input graph, assign any of
        the subcomponent root as the graph root to minimize one operation
         */
        if (treeRoot == -1) {
            treeRoot = componentRoots.get(0);
        }
        for (int root : componentRoots) {
            if (root != treeRoot) {
                tree[root] = treeRoot;
            }
        }

        int numChange = 0;
        for (int i = 0; i < n; i++) {
            if (graph[i] != tree[i]) {
                numChange++;
            }
            tree[i]++;
        }
        out.println(numChange);
        for (int i = 0; i < n; i++) {
            out.print(tree[i] + " ");
        }
        out.println();
        out.close();
    }

    private static void removeMultiEdges() {
        for (int i = 0; i < tree.length; i++) {
            if (i == tree[tree[i]]) {
                tree[i] = i;
            }
        }
    }

    private static int traverseComponent(int node, int parent) {
        visited[node] = true;
        int root = -1;
        if (tree[node] == node) {
            root = node;
        }

        for (int child : adjList.get(node)) {
            /*
            Component cannot have both root and cycle. If cycle is found,
            remove edge and make this root of component.
             */
            if (visited[child]) {
                if (child != parent && root == -1) {
                    tree[node] = node;
                    root = Math.max(root, node);
                }
                continue;
            }
            root = Math.max(root, traverseComponent(child, node));
        }
        return root;
    }
}