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 MAXN = 2e5 + 10;
int N, A[MAXN], ans[MAXN];
vector<int> cyc[MAXN];
bool vis[MAXN];
int main() {
  scanf("%d", &N);
  int isame = -1;
  for (int i = 1; i <= N; i++) {
    scanf("%d", &A[i]);
    if (i == A[i]) {
      isame = i;
    }
  }
  for (int i = 1; i <= N; i++) {
    ans[i] = A[i];
  }
  for (int i = 1; i <= N; i++) {
    if (vis[i]) {
      continue;
    }
    vector<int> vc;
    int cur = i;
    while (true) {
      vc.push_back(cur);
      vis[cur] = true;
      int ncur = A[cur];
      if (vis[ncur]) {
        auto it = find(vc.begin(), vc.end(), ncur);
        if (it == vc.end()) {
          break;
        }
        vc.erase(vc.begin(), it);
        if (i == 1 && isame == -1) {
          isame = vc.back();
          ans[isame] = isame;
        } else {
          ans[vc.back()] = isame;
        }
        break;
      }
      cur = A[cur];
    }
  }
  int ndiff = 0;
  for (int i = 1; i <= N; i++) {
    ndiff += (A[i] != ans[i]);
  }
  printf("%d\n", ndiff);
  for (int i = 1; i <= N; i++) {
    printf("%d ", ans[i]);
  }
  puts("");
}
