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 = 2e5 + 10;
int a[maxn], fa[maxn], cnt = 0;
pair<int, int> pa[maxn];
int find(int x) {
  if (x != fa[x]) {
    fa[x] = find(fa[x]);
  }
  return fa[x];
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    fa[i] = i;
  }
  int pos = -1;
  for (int i = 1; i <= n; i++) {
    int x = find(i), y = find(a[i]);
    if (x != y) {
      fa[x] = y;
    } else {
      if (i == a[i]) {
        pos = cnt;
      }
      pa[cnt++] = make_pair(i, a[i]);
    }
  }
  if (pos == -1) {
    pos = 0;
    cnt++;
    a[pa[0].first] = pa[0].first;
  }
  for (int i = 0; i < cnt; i++) {
    if (i == pos) continue;
    a[pa[i].first] = pa[pos].first;
  }
  printf("%d\n", cnt - 1);
  for (int i = 1; i <= n; i++) {
    printf("%d ", a[i]);
  }
}
