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.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class B {

	static final int EXP = 1, VIS = 2, UNVIS = 0;
	static int ans;
	static int[] p, state;
	static boolean[] inCycle;
	
	static void dfs(int u)
	{
		state[u] = EXP;
		if(p[u] == u)
		{
			state[u] = VIS;
			return;
		}
		if(state[p[u]] == UNVIS)
			dfs(p[u]);
		else if(state[p[u]] == EXP)
		{
			++ans;
			p[u] = u;
			inCycle[u] = true;
		}
		state[u] = VIS;
	}
	
	//stackoverflow
	public static void sol() throws IOException 
	{
		Scanner sc = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);

		int n = sc.nextInt();
		p = new int[n];
		for(int i = 0; i < n; ++i)
			p[i] = sc.nextInt() - 1;
		state = new int[n];
		inCycle = new boolean[n];
		for(int i = 0; i < n; ++i)
			if(state[i] == UNVIS)
				dfs(i);
		
		int root = -1;
		for(int i = 0; root == -1 && i < n; ++i)
			if(p[i] == i && !inCycle[i])
				root = i;
		
		for(int i = 0; i < n; ++i)
			if(i != root && p[i] == i)
				if(root == -1)
					root = i;
				else
				{
					if(!inCycle[i])
						++ans;
					p[i] = root;
				}
		StringBuilder sb = new StringBuilder();
		sb.append(ans+"\n");
		for(int i = 0; i < n; ++i)
			sb.append((p[i] + 1) + " ");
		out.println(sb);
		out.flush();
		out.close();
	}

	
	public static void main(String[] args) {new Thread(null, new Runnable() { public void run() {try {
		sol();
	} catch (IOException e) {
		
		e.printStackTrace();
	}}}, "2",1<<26).start();}
	
	
	static class Scanner 
	{
		StringTokenizer st;
		BufferedReader br;

		public Scanner(InputStream s){	br = new BufferedReader(new InputStreamReader(s));}

		public String next() throws IOException 
		{
			while (st == null || !st.hasMoreTokens()) 
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}

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

		public long nextLong() throws IOException {return Long.parseLong(next());}

		public String nextLine() throws IOException {return br.readLine();}

		public double nextDouble() throws IOException
		{
			String x = next();
			StringBuilder sb = new StringBuilder("0");
			double res = 0, f = 1;
			boolean dec = false, neg = false;
			int start = 0;
			if(x.charAt(0) == '-')
			{
				neg = true;
				start++;
			}
			for(int i = start; i < x.length(); i++)
				if(x.charAt(i) == '.')
				{
					res = Long.parseLong(sb.toString());
					sb = new StringBuilder("0");
					dec = true;
				}
				else
				{
					sb.append(x.charAt(i));
					if(dec)
						f *= 10;
				}
			res += Long.parseLong(sb.toString()) / f;
			return res * (neg?-1:1);
		}


		public boolean ready() throws IOException {return br.ready();}

	}
}