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 long long N = 2e5 + 5;
long long n;
long long a[N], vis[N], root[N];
long long dfs(long long k) {
  if (vis[k]) return root[k];
  vis[k] = 1;
  root[k] = k;
  root[k] = dfs(a[k]);
  return root[k];
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n;
  for (long long i = 1; i <= n; i++) cin >> a[i];
  for (long long i = 1; i <= n; i++) dfs(a[i]);
  long long ans = -1, actualroot = -1;
  for (long long i = 1; i <= n; i++) {
    ans += (i == dfs(a[i]));
    if (i == a[i]) actualroot = i;
  }
  if (actualroot == -1) {
    ans++;
    for (long long i = 1; i <= n; i++) {
      if (i == dfs(a[i])) {
        actualroot = i;
        a[i] = i;
        break;
      }
    }
  }
  for (long long i = 1; i <= n; i++) {
    if (i == dfs(a[i])) {
      a[i] = actualroot;
    }
  }
  cout << ans << "\n";
  for (long long i = 1; i <= n; i++) cout << a[i] << " ";
  return 0;
}
