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 N = 200010;
inline int read() {
  int x = 0;
  bool f = true;
  char c = getchar();
  while (!isdigit(c)) {
    if (c == '-') f = false;
    c = getchar();
  }
  while (isdigit(c)) x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
  return f ? x : -x;
}
int f[N];
int get(int x) { return x == f[x] ? x : f[x] = get(f[x]); }
int n, p[N];
int ans, root;
int main() {
  n = read();
  for (register int i = 1; i <= n; ++i) f[i] = i;
  for (register int i = 1; i <= n; ++i) {
    p[i] = read();
  }
  for (register int i = 1; i <= n; ++i) {
    if (i == p[i]) {
      root = i;
      break;
    }
  }
  for (register int i = 1; i <= n; ++i) {
    if (i == root) continue;
    int fp = get(p[i]), fi = get(i);
    if (fp == fi) {
      if (!root) root = i;
      fi = root, p[i] = root, ++ans;
    }
    f[fi] = fp;
  }
  printf("%d\n", ans);
  for (register int i = 1; i <= n; ++i) printf("%d ", p[i]);
  return 0;
}
