Fix a Tree CodeForces - 698B

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 nintegers p₁, p₂, ..., p_n, where p_i denotes a parent of vertex i (here, for convenience a root is considered its own parent).

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

Given a sequence p₁, p₂, ..., p_n, one is able to restore a tree:

1. There must be exactly one index r that p_r = 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 p_i.

A sequence p₁, p₂, ..., p_n 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 a₁, a₂, ..., a_n, 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 a₁, a₂, ..., a_n (1 ≤ a_i ≤ 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 (a₁, a₂, ..., a_n) in the minimum number of changes. If there are many such sequences, any of them will be accepted.

Example

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 p₄ = 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.

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

在已经给的有向图里面，可能会有环，树枝或者单点，解决时，比如起初beg[1] = 2就可以把1,2连在一个集合里，总是让有向树最终被指向的那个节点做集合的老大，这样如果连接时他们已经在同一个集合了，并且 x！=y那么必定是环，做好集合划分后，就可以两个循环，第一个循环找变化次数，和树根，如果有数枝或单点，那么其中之1的老大做总老大，并且变化次数为集合数减1，否则全是环的话，任选其一，变化数为集合数。

#include <iostream>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
#include <math.h>
#include <map>
#include <stdio.h>
#include <queue>

using namespace std;

int pre[1000000];
int beg[1000000];
int sign[1000000];
void init(int n)
{
    for(int i = 0; i <= n; i++)
        pre[i] = i;
}
int Find(int x)
{
    return pre[x] == x ? x : pre[x] = Find(pre[x]);
}
void join(int x,int y)
{
    int fx = Find(x);
    int fy = Find(y);
    if(fx!=fy)
    {
        pre[fx] = fy;
        sign[fx] = sign[fx] || sign[fy];
    }
    else
    {
        if(x!=y)
        sign[fx] = 1;
    }
}

int main()
{
    int n;
    scanf("%d",&n);
    init(n);
    for(int i = 1; i <= n;i++)
    {
        scanf("%d",&beg[i]);
        join(i,beg[i]);
    }
    int root = -1;
    int num = 0;
    for(int i = 1; i <= n; i++)
    {
        if(pre[i] == i)
        {
            num++;
            if(sign[i]==0&&root ==-1)
            {
                root = i;
                num--;
            }
        }
    }
    if(root == -1)
    {
        root = Find(1);
        beg[root] = root;
    }
    for(int i = 1;i <= n; i++)
    {
        if(pre[i] == i)
        {
            beg[i] = root;
        }
    }
    printf("%d\n",num);
    for(int i = 1; i <= n; i++)
    {
        if(i == n)
              printf("%d\n",beg[i]);
        else
             printf("%d ",beg[i]);
    }
    return 0;
}