#include <bits/stdc++.h>
using namespace std;
int n, a[200005], parent[200005];
vector<int> komponen;
int findParent(int x) {
  return parent[x] == x ? x : parent[x] = findParent(parent[x]);
}
void merge(int x, int y) {
  x = findParent(x);
  y = findParent(y);
  if (x != y) {
    parent[y] = x;
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    parent[i] = i;
  }
  for (int i = 1; i <= n; i++) {
    merge(a[i], i);
  }
  int root = -1;
  for (int i = 1; i <= n; i++) {
    if (a[i] == i) root = i;
  }
  for (int i = 1; i <= n; i++) {
    if (findParent(i) == i) {
      if (root == -1) root = i;
      komponen.push_back(i);
    }
  }
  int ans = 0;
  for (int i = 0; i < komponen.size(); i++) {
    if (a[komponen[i]] != root) {
      a[komponen[i]] = root;
      ans++;
    }
  }
  printf("%d\n", ans);
  for (int i = 1; i <= n; i++) {
    if (i > 1) printf(" ");
    printf("%d", a[i]);
  }
  printf("\n");
  return 0;
}
