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;
int main() {
  int n, i, a[200001], flag[200001], cnt(0), root, j, res(0);
  cin >> n;
  for (i = 1; i <= n; i++) {
    cin >> a[i];
    if (i == a[i]) root = i;
  }
  fill(flag + 1, flag + 200001, 0);
  for (i = 1; i <= n; i++) {
    if (flag[i] == 0) {
      cnt++;
      j = i;
      while (flag[j] == 0) {
        flag[j] = cnt;
        j = a[j];
      }
      if (flag[j] == cnt) {
        if (root == 0) {
          root = j;
          a[j] = j;
          res++;
        } else {
          a[j] = root;
          res++;
        }
      }
    }
  }
  cout << res << '\n';
  for (i = 1; i <= n; i++) cout << a[i] << " ";
}
