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 

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int pre[maxn], a[maxn];
int Find(int x) { return x == pre[x] ? x : pre[x] = Find(pre[x]); }
void Union(int x, int y) {
  int fx = Find(x), fy = Find(y);
  if (fx != fy) pre[fx] = fy;
}
int main() {
  int n, root = -1, cnt = 0;
  scanf("%d", &n);
  bool flag = false;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    pre[i] = i;
    if (i == a[i]) root = a[i], flag = true;
  }
  if (root == -1) root = 1;
  for (int i = 1; i <= n; i++) {
    if (a[i] == i)
      Union(i, root), a[i] = root, cnt++;
    else if (Find(i) != Find(a[i]))
      Union(i, a[i]);
    else
      Union(i, root), a[i] = root, cnt++;
  }
  printf("%d\n", cnt - flag);
  for (int i = 1; i <= n; i++) printf("%d ", a[i]);
  return 0;
}
