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 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;
}
