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 act, root = -1;
int to[200010];
int u[200010];
vector<int> cycleV;
void dfs(int v) {
  u[v] = 1;
  if (to[v] == v) {
    if (root == -1) {
      root = v;
    } else {
      act++;
      to[v] = root;
    }
  } else if (u[to[v]] == 1) {
    cycleV.push_back(v);
  } else if (u[to[v]] == 0) {
    dfs(to[v]);
  }
  u[v] = 2;
}
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> to[i];
    to[i]--;
  }
  for (int i = 0; i < n; i++) {
    if (!u[i]) {
      dfs(i);
    }
  }
  for (int v : cycleV) {
    if (root == -1) {
      act++;
      to[v] = v;
      root = v;
    } else {
      act++;
      to[v] = root;
    }
  }
  cout << act << "\n";
  for (int i = 0; i < n; i++) {
    cout << to[i] + 1 << " ";
  }
}
