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 


tree_size = int(input())

parents = [int(x)-1 for x in input().split(' ')]


num_changes = 0

root = None
for node, parent in enumerate(parents):
	if parent == node:
		root = node
		break

if not root:
	root = tree_size

finished = set()
visited = set()

visited.add(root)
finished.add(root)

def visit(node):
	global num_changes

	visited.add(node)
	if parents[node] not in finished:
		if parents[node] in visited:
			parents[node] = root
			num_changes += 1
		else:
			visit(parents[node])

	finished.add(node)

for node in range(tree_size):
	if node not in visited:
		visit(node)

new_root = None

for node, parent in enumerate(parents):
	if parent == tree_size:
		if not new_root:
			new_root = node
		parents[node] = new_root

for i in range(tree_size):
	parents[i] += 1


print(num_changes)
print(*parents)