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 INF = 0x3f3f3f3f, MOD = 1e9 + 7;
int n;
int a[200010];
int par[200010];
int find(int x) { return (par[x] == x) ? x : (par[x] = find(par[x])); }
int unio(int x, int y) {
  int _x = find(x);
  int _y = find(y);
  if (_x != _y) par[_x] = _y;
}
int main() {
  cin >> n;
  int root = 0, ans = 0;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    par[i] = i;
    if (a[i] == i) root = i;
  }
  for (int i = 1; i <= n; i++) {
    if (i == root) continue;
    if (i == a[i] && i != root) {
      a[i] = root;
      ans++;
    } else {
      if (find(i) != find(a[i])) {
        unio(i, a[i]);
      } else {
        ans++;
        if (!root) {
          a[i] = i;
          root = i;
          continue;
        }
        a[i] = root;
      }
    }
  }
  cout << ans << endl;
  for (int i = 1; i <= n; i++) {
    cout << a[i] << " ";
  }
  return 0;
}
