#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;
}
