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 MAX_N = 200000;
int N, P[MAX_N + 5], V[MAX_N + 5], r, g, ans;
vector<int> E[MAX_N + 5];
void dfs(int nod) {
  int i;
  V[nod] = g;
  for (i = 0; i < E[nod].size(); i++)
    if (!V[E[nod][i]]) dfs(E[nod][i]);
}
int cycle(int nw) {
  if (V[nw]) return nw;
  V[nw] = g;
  return cycle(P[nw]);
}
int main() {
  int i, t;
  scanf("%d", &N);
  for (i = 1; i <= N; i++) {
    scanf("%d", P + i);
    E[i].push_back(P[i]);
    E[P[i]].push_back(i);
  }
  for (i = 1; i <= N; i++)
    if (P[i] == i) {
      r = i, ++g;
      dfs(i);
    }
  for (i = 1; i <= N; i++)
    if (P[i] == i && i != r) P[i] = r, ans++;
  for (i = 1; i <= N; i++)
    if (!V[i]) {
      ++g;
      t = cycle(i);
      if (g == 1)
        P[t] = t;
      else
        P[t] = r;
      ans++;
      break;
    }
  printf("%d\n", ans);
  for (i = 1; i <= N; i++) printf("%d ", P[i]);
  return 0;
}
