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 = 200010;
int f[maxn];
int vis[maxn] = {};
int n;
int main() {
  cin >> n;
  for (int i = (1); i <= (n); i++) {
    scanf("%d", f + i);
  }
  int huan = 0, root = 0;
  vector<int> hh;
  hh.clear();
  for (int i = (1); i <= (n); i++) {
    if (!vis[i]) {
      int num = 0;
      int u = i;
      do {
        num++;
        vis[u] = i;
        u = f[u];
      } while (!vis[u]);
      if (vis[u] == vis[i]) {
        huan++;
        if (u == f[u] && !root)
          root = u;
        else
          hh.push_back(u);
      }
    }
  }
  printf("%d\n", hh.size());
  if (!root) {
    root = hh[hh.size() - 1];
    hh.pop_back();
    f[root] = root;
  }
  for (int i = (0); i <= (((int)hh.size()) - 1); i++) f[hh[i]] = root;
  for (int i = (1); i <= (n); i++) printf("%d ", f[i]);
  return 0;
}
