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 = 200000 + 10;
int a[maxn];
int f[maxn];
int find(int x) { return x == f[x] ? x : f[x] = find(f[x]); }
int main() {
  int n;
  int cot = 0;
  int root = 0;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) f[i] = i;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    if (a[i] == i) {
      cot++;
      root = i;
    } else {
      int bossx = find(i);
      int bossy = find(a[i]);
      if (bossx == bossy) {
        cot++;
        a[i] = i;
      } else
        f[bossx] = bossy;
    }
  }
  if (root == 0) {
    for (int i = 1; i <= n; i++) {
      if (f[i] == i) {
        root = i;
        cot++;
        break;
      }
    }
  }
  printf("%d\n", cot - 1);
  for (int i = 1; i <= n; i++) {
    if (f[i] == i) a[i] = root;
    if (i < n)
      printf("%d ", a[i]);
    else
      printf("%d\n", a[i]);
  }
  return 0;
}
