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 f[200001] = {};
bool v[200001] = {};
int find(int x) {
  memset(v, 0, sizeof(v));
  int k, j, r;
  r = x;
  v[r] = 1;
  while (r != f[r]) {
    if (v[f[r]]) {
      f[r] = r;
      break;
    }
    r = f[r];
    v[r] = 1;
  }
  k = x;
  while (k != r) {
    j = f[k];
    f[k] = r;
    k = j;
  }
  return r;
}
int rf[200001] = {};
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    f[i] = i;
  }
  for (int i = 1; i <= n; i++) {
    cin >> f[i];
    rf[i] = f[i];
  }
  for (int i = 1; i <= n; i++) {
    find(i);
  }
  int count = 0;
  int orig = 0;
  for (int i = 1; i <= n; i++) {
    if (f[i] == i) {
      if (orig == 0) {
        orig = i;
      } else {
        rf[i] = orig;
      }
      count++;
    }
  }
  for (int i = 1; i <= n; i++) {
    if (rf[i] == i) break;
    if (f[i] == i && rf[i] != i) {
      rf[i] = i;
      count++;
      break;
    }
  }
  cout << count - 1 << endl;
  for (int i = 1; i <= n; i++) {
    cout << rf[i] << (i < n ? " " : "\n");
  }
  return 0;
}
