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.util.*;
import java.lang.*;
import java.lang.reflect.Array;
import java.io.*;
import java.math.*;
import java.text.DecimalFormat;
public class Prac{     
    static class InputReader { 
        private final InputStream stream;
	private final byte[] buf = new byte[8192];
	private int curChar, snumChars;
 	public InputReader(InputStream st) {
            this.stream = st;
	} 
	public int read() {
            if (snumChars == -1)
	 	throw new InputMismatchException();
            if (curChar >= snumChars) {
		curChar = 0;
                try {
                    snumChars = stream.read(buf);
		} 
                catch (IOException e) {
                    throw new InputMismatchException();
           	}
		if (snumChars <= 0)
                    return -1;
            }
            return buf[curChar++];
	}
        public int ni() {
            int c = read();
            while (isSpaceChar(c)) {
               	c = read();
            }
            int sgn = 1;
            if (c == '-') {
		sgn = -1;
		c = read();
            }
            int res = 0;
            do {
		res *= 10;
		res += c - '0';
		c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
	} 
	public long nl() {
            int c = read();
            while (isSpaceChar(c)) {
            c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            long res = 0;
            do {
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
	} 
	public int[] nia(int n) {
            int a[] = new int[n];
            for (int i = 0; i < n; i++) {
		a[i] = ni();
            }
            return a;
	} 
	public String rs() {
            int c = read();
            while (isSpaceChar(c)) {
		c = read();
            }
            StringBuilder res = new StringBuilder();
            do {
		res.appendCodePoint(c);
                    c = read();
            } while (!isSpaceChar(c));
            return res.toString();
	}
	public String nextLine() {
            int c = read();
            while (isSpaceChar(c))
		c = read();
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isEndOfLine(c));
            return res.toString();
        } 
	public boolean isSpaceChar(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
	}
 
	private boolean isEndOfLine(int c) {
            return c == '\n' || c == '\r' || c == -1;
	} 
    }
    static PrintWriter w = new PrintWriter(System.out);
    static boolean f,v[];
    static int p[],root=-1;
    public static void main(String[] args) throws IOException {   
        InputReader sc=new InputReader(System.in);
        int n=sc.ni();
        
        p=new int[n+1];
        
        int t[]=new int[n+1];
        v=new boolean[n+1];
        
        for(int i=1;i<=n;i++){
            
            int a=sc.ni();
            t[i]=a;
            p[i]=a;
            
        }
        for(int i=1;i<=n;i++){
            if(i==p[i]){
                root=i;
                //break;
            }
        }
        int c=0;
        int temp[]=new int[n+1];
        Arrays.fill(temp,-1);
        for(int i=1;i<=n;i++){
           
                
                
                Set<Integer> set=new HashSet<Integer>();
                int i1=i;
                
                while(i1!=p[i1]&&!v[i1]){                  
                    
                    set.add(i1);
                    v[i1]=true;
                    i1=p[i1];
                }
                v[i1]=true;
                if(set.contains(i1)&&p[i1]!=i1){
                    if(root==-1){
                        root=i1;
                        p[i1]=i1;
                    }
                    else{
                        p[i1]=root;
                    }
                    c++;
                }
                else if(root!=i1&&p[i1]==i1){
                    p[i1]=root;
                    c++;
                }
                
                
                
                
                
            }
                

        
        w.println(c);
        for(int i=1;i<=n;i++){
            w.print(p[i]+" ");
        }
        w.println();
        w.close();
    }
}


