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;
int par[400005];
int arr[400005];
int find_par(int n) {
  if (par[n] == n)
    return n;
  else
    return par[n] = find_par(par[n]);
}
int visited[500005];
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    par[i] = i;
  }
  int root = 0;
  int cnt = 0;
  for (int i = 1; i <= n; i++) {
    cin >> arr[i];
    int x = find_par(i);
    int y = find_par(arr[i]);
    if (arr[i] == i) root = i;
    if (x != y) par[x] = y;
    if (x == y) {
      visited[i] = 1;
    }
  }
  if (!root) {
    for (int i = 1; i <= n; i++) {
      int x = find_par(i);
      int y = find_par(arr[i]);
      if (x == y) {
        root = x;
        break;
      }
    }
  }
  int index;
  for (int i = 1; i <= n; i++) {
    if (visited[i]) {
      if (arr[i] != root) {
        cnt++;
        arr[i] = root;
      }
    }
  }
  cout << cnt << endl;
  for (int i = 1; i <= n; i++) {
    cout << arr[i] << " ";
  }
}
