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;
int p[200010], vs[200010];
vector<int> cyc;
int main() {
  int N;
  scanf("%d", &N);
  for (int i = 1; i <= N; i++) scanf("%d", &p[i]);
  int vc = 0, root = -1;
  for (int i = 1; i <= N; i++) {
    if (vs[i] > 0) continue;
    int st = vc, now = i;
    for (;;) {
      if (vs[now] == 0) {
        vs[now] = ++vc;
      } else {
        if (vs[now] > st) {
          int sz = vc - vs[now] + 1;
          if (sz == 1) root = now;
          cyc.push_back(now);
        }
        break;
      }
      now = p[now];
    }
  }
  int ans = 0;
  if (!cyc.empty()) {
    if (root == -1) root = cyc[0];
    for (int x : cyc) {
      if (p[x] != root) {
        p[x] = root;
        ans++;
      }
    }
  }
  printf("%d\n", ans);
  for (int i = 1; i <= N; i++) printf("%d ", p[i]);
  printf("\n");
  return 0;
}
