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;
int n;
int f[200005], a[200005];
int ans[200005];
int find(int x) {
  if (x == f[x])
    return x;
  else
    return f[x] = find(f[x]);
}
void Union(int x, int y) {
  int fx = find(x);
  int fy = find(y);
  if (fx != fy) f[fx] = fy;
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) f[i] = i;
  int cnt = 0;
  int t = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    if (find(a[i]) == find(i)) {
      ans[cnt++] = i;
      if (a[i] == i) {
        t = find(i);
      }
    }
    Union(i, a[i]);
  }
  int cnt1 = 0;
  if (t == 0) {
    for (int i = 1; i <= n; i++) {
      if (find(i) == find(a[i])) {
        t = find(i);
      }
    }
  }
  for (int i = 0; i < cnt; i++) {
    if (a[ans[i]] != t) {
      a[ans[i]] = t;
      cnt1++;
    }
  }
  cout << cnt1 << endl;
  for (int i = 1; i <= n; i++) {
    if (i == 1)
      printf("%d", a[i]);
    else
      printf(" %d", a[i]);
  }
  cout << endl;
}
