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;
const int N = 2e5 + 5;
int up[N], n, a[N], root, cnt;
int f(int u) {
  if (up[u] == u) return u;
  return up[u] = f(up[u]);
}
void uni(int u, int v) { up[f(u)] = f(v); }
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) up[i] = i;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    uni(i, a[i]);
  }
  for (int i = 1; i <= n; i++) {
    if (f(i) == i) {
      if (a[i] == i) root = i;
      cnt++;
    }
  }
  if (root)
    cout << cnt - 1 << endl;
  else
    cout << cnt << endl;
  if (!root) root = f(1);
  for (int i = 1; i <= n; i++) {
    if (f(i) == i)
      cout << root << ' ';
    else
      cout << a[i] << ' ';
  }
}
