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 + 50;
const int INF = 0x3f3f3f3f;
int a[maxn], fa[maxn], b[maxn], c[maxn], vis[maxn], tot = 0;
int findfa(int x) { return fa[x] == x ? x : fa[x] = findfa(fa[x]); }
void uni(int x, int y) {
  int fax = findfa(x);
  int fay = findfa(y);
  if (fax != fay)
    fa[fax] = fay;
  else if (x != y)
    b[++tot] = x;
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < maxn; i++) {
    fa[i] = i;
    vis[i] = 0;
  }
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    uni(i, a[i]);
  }
  int cnt = 0;
  for (int i = 1; i <= n; i++)
    if (findfa(i) == i) c[++cnt] = i;
  printf("%d\n", cnt - 1);
  for (int i = 1; i <= tot; i++) {
    for (int j = 2; j <= cnt; j++) {
      if (vis[j]) continue;
      if (findfa(b[i]) == c[1]) {
        a[b[i]] = c[j];
        uni(b[i], c[j]);
        vis[j] = 1;
        break;
      } else {
        a[b[i]] = c[1];
        uni(b[i], c[1]);
        vis[j] = 1;
        break;
      }
    }
  }
  int x = 0;
  int k;
  for (int i = 1; i <= n; i++)
    if (findfa(i) == i) {
      x++;
      if (x == 1) k = i;
      if (x > 1) a[i] = k;
    }
  for (int i = 1; i <= n; i++) printf("%d ", a[i]);
}
