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 = 200000 + 5;
int pre[N];
int t[N];
vector<int> s;
int Find(int x) { return x == pre[x] ? x : pre[x] = Find(pre[x]); }
void Union(int x, int y) {
  int fx = Find(x), fy = Find(y);
  if (fx != fy) pre[fx] = fy;
}
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) pre[i] = i;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &t[i]);
    Union(i, t[i]);
  }
  int cot = 0;
  int e = 0;
  for (int i = 1; i <= n; i++)
    if (i == Find(pre[i]) && t[i] == i) {
      e = i;
      break;
    }
  for (int i = 1; i <= n; i++) {
    if (i == e) continue;
    if (i == Find(pre[i])) {
      cot++;
      if (e)
        t[i] = e;
      else {
        t[i] = i;
        e = i;
      }
    }
  }
  cout << cot << endl;
  for (int i = 1; i < n; i++) printf("%d ", t[i]);
  cout << t[n] << endl;
  return 0;
}
