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 = 3e5;
int n, fa[N], p[N], cnt, mk, la[N];
int getfa(int x) {
  if (fa[x] == x) return x;
  return fa[x] = getfa(fa[x]);
}
void merge(int x, int y) {
  int fx = getfa(x), fy = getfa(y);
  fa[fx] = fy;
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> p[i];
  for (int i = 1; i <= n; i++) {
    fa[i] = i;
    if (p[i] == i) {
      if (!mk)
        mk = i;
      else
        p[i] = mk, cnt++;
    }
  }
  if (!mk) {
    for (int i = 1; i <= n; i++) la[p[i]]++;
    int now = 0;
    for (int i = 1; i <= n; i++) {
      if (la[i] > now) {
        now = la[i];
        mk = i;
      }
    }
    p[mk] = mk;
    cnt++;
  }
  for (int i = 1; i <= n; i++) {
    if (p[i] == i) continue;
    if (getfa(i) == getfa(p[i])) p[i] = mk, cnt++;
    merge(i, p[i]);
  }
  cout << cnt << endl;
  for (int i = 1; i <= n; i++) cout << p[i] << " ";
  cout << endl;
  return 0;
}
