#include <bits/stdc++.h>
using namespace std;
int var, p[200001], root = -1, n, cnt, T = 0, v[200001];
void dfs(int s) {
  v[s] = T;
  if (!v[p[s]])
    dfs(p[s]);
  else {
    if (v[p[s]] == T) {
      if (root == -1) {
        cnt++;
        p[s] = s;
        root = s;
      } else if (s != root) {
        cnt++;
        p[s] = root;
      }
    }
  }
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> p[i];
    if (i == p[i]) root = i;
  }
  for (int i = 1; i <= n; i++) {
    if (!v[i]) {
      T++;
      dfs(i);
    }
  }
  cout << cnt << endl;
  for (int i = 1; i <= n; i++) cout << p[i] << " ";
}
