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 = 2e5 + 5;
const long double INF = 1e9;
int n;
int a[N];
int used[N];
int answer[N];
int main() {
  scanf("%d", &n);
  int r = -1;
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    a[i]--;
    answer[i] = a[i];
    if (i == a[i]) r = i;
  }
  int color = 0;
  for (int i = 0; i < n; i++) {
    if (used[i] > 0) continue;
    int j = i;
    color = color + 1;
    while (true) {
      used[j] = color;
      int nxt = a[j];
      if (used[nxt] == color) {
        if (r == -1) {
          r = j;
        }
        answer[j] = r;
        break;
      }
      if (used[nxt] > 0) {
        break;
      }
      j = nxt;
    }
  }
  int ans = 0;
  for (int i = 0; i < n; i++) {
    if (answer[i] != a[i]) ans++;
  }
  printf("%d\n", ans);
  for (int i = 0; i < n; i++) {
    printf("%d ", 1 + answer[i]);
  }
}
