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;
vector<int> e[200005];
int n;
int r = -1;
int a[200005];
int on[200005];
int fa[200005];
int ans;
int gf(int x) {
  if (x == fa[x])
    return x;
  else {
    return fa[x] = gf(fa[x]);
  }
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    if (a[i] == i) {
      r = i;
    }
    fa[i] = i;
  }
  for (int i = 1; i <= n; i++) {
    int u = gf(i);
    int v = gf(a[i]);
    if (u == v) {
      if (r == 0) r = i;
      on[i] = 1;
    } else {
      fa[u] = v;
    }
  }
  for (int i = 1; i <= n; i++) {
    if (on[i] && a[i] != r) {
      ans++;
      a[i] = r;
    }
  }
  cout << ans << endl;
  for (int i = 1; i <= n; i++) {
    cout << a[i] << " ";
  }
  return 0;
}
