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 = 2e5 + 100;
int fa[maxn];
int rt;
int n, vis[maxn];
vector<int> vec;
int num;
void dfs(int u) {
  vec.push_back(u);
  vis[u] = 2;
  if (vis[fa[u]] == 1) return;
  if (vis[fa[u]] == 2) {
    num++;
    if (rt == 0) {
      rt = u;
      fa[u] = u;
    } else {
      fa[u] = rt;
    }
  } else {
    dfs(fa[u]);
  }
}
void solve() {
  int tag = 0;
  rt = 0;
  for (int i = 1; i <= n; i++) {
    if (i == fa[i]) {
      tag = 1;
      rt = i;
      break;
    }
  }
  num = 0;
  memset(vis, 0, sizeof(vis));
  for (int i = 1; i <= n; i++) {
    if (!vis[i]) {
      vec.clear();
      dfs(i);
      for (int j = 0; j < vec.size(); j++) {
        vis[vec[j]] = 1;
      }
    }
  }
  printf("%d\n", num - tag);
  for (int i = 1; i <= n; i++) {
    printf("%d%c", fa[i], (i == n ? '\n' : ' '));
  }
}
int main() {
  while (scanf("%d", &n) != EOF) {
    for (int i = 1; i <= n; i++) {
      scanf("%d", &fa[i]);
    }
    solve();
  }
  return 0;
}
