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.*;
public class May {
	static boolean[] done;
	static List<Integer> list = new ArrayList<>();
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int a[] = new int[n+1];
		for(int i =1;i<=n;i++) {
			a[i] = sc.nextInt();
		}
		    int[] parent = new int[n+1];
		    for(int i=0;i<=n;++i) parent[i] = i;
		   
	done = new boolean[n+1];
	for(int i=1;i<=n;++i) {
		if(!done[i]) {
			go(parent,new boolean[n+1],a,i);
		}
	}
	int val = -1;
	boolean yes = false;
	for(int i=1;i<=n;++i) {
		if(parent[i] == i) {
			if(!yes) {
				val = i;
				yes = true;
			}else parent[i] = val;
		}
	}
	if(val == -1) val = list.get(0);
	for(int x : list) parent[x] = val;
	int changes = 0;
	for(int i=1;i<=n;++i) if(a[i] != parent[i]) ++changes;
	System.out.println(changes);
	for(int i=1;i<=n;++i) System.out.print(parent[i]+" ");
	
	}
	private static void go(int[] parent,boolean[] visited, int[] a, int i) {
		if(visited[i]) {
			list.add(i);
			return ;
		}
		if(a[i] != i && !visited[i]) {
    		parent[i] = a[i];
    		done[i] = true;
    		visited[i] = true;
    		go(parent,visited,a,a[i]);
    	}
		
	}
	
	}

