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 = 2e5 + 10;
bitset<N> went, in;
int p[N], root = 0, ans = 0;
bool first = true;
void dfs(int now) {
  in[now] = went[now] = true;
  if (went[p[now]]) {
    if (in[p[now]]) {
      ans++;
      if (first) {
        first = false;
        root = now;
        p[now] = now;
      } else
        p[now] = root;
    }
  }
  in[now] = false;
  return;
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &p[i]);
    if (i == p[i]) {
      if (first) {
        first = false;
        root = i;
      } else {
        p[i] = root;
        ans++;
      }
    }
  }
  went.reset();
  in.reset();
  for (int i = 1; i <= n; i++)
    if (!went[i]) dfs(i);
  printf("%d\n%d", ans, p[1]);
  for (int i = 2; i <= n; i++) printf(" %d", p[i]);
  printf("\n");
}
