#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f, MOD = 1e9 + 7;
int n;
int a[200010];
int par[200010];
int find(int x) { return (par[x] == x) ? x : (par[x] = find(par[x])); }
int unio(int x, int y) {
  int _x = find(x);
  int _y = find(y);
  if (_x != _y) par[_x] = _y;
}
int main() {
  cin >> n;
  int root = 0, ans = 0;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    par[i] = i;
    if (a[i] == i) root = i;
  }
  for (int i = 1; i <= n; i++) {
    if (i == root) continue;
    if (i == a[i] && i != root) {
      a[i] = root;
      ans++;
    } else {
      if (find(i) != find(a[i])) {
        unio(i, a[i]);
      } else {
        ans++;
        if (!root) {
          a[i] = i;
          root = i;
          continue;
        }
        a[i] = root;
      }
    }
  }
  cout << ans << endl;
  for (int i = 1; i <= n; i++) {
    cout << a[i] << " ";
  }
  return 0;
}
