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 = 105;
const int inf = 1e9;
int p[maxn], f[maxn], n;
int root(int x) {
  if (!f[x]) return x;
  return f[x] = root(f[x]);
}
int merge(int x, int y) {
  x = root(x);
  y = root(y);
  if (x == y) return 0;
  f[x] = y;
  return 1;
}
int main() {
  scanf("%d", &n);
  int cnt = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &p[i]);
    cnt += merge(i, p[i]);
  }
  printf("%d\n", n - 1 - cnt);
  int x = root(1);
  for (int i = 1; i <= n; i++) {
    if (!f[i]) {
      p[i] = x;
    }
    printf("%d ", p[i]);
  }
  printf("\n");
  return 0;
}
