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 INF = 0x3f3f3f3f, MOD = 1e9 + 7;
int n;
int a[200010];
int ans = 0;
vector<int> G[200010];
int vis[200010];
int root = -1;
int cnt = 0;
int dfs(int u, int p) {
  cnt++;
  int t = 0;
  if (a[u] == u) t = 1;
  vis[u] = 1;
  for (int i = 0; i < G[u].size(); i++) {
    int v = G[u][i];
    if (!vis[v]) {
      int m = dfs(v, u);
      t |= m;
    }
  }
  return t;
}
int main() {
  memset(vis, 0, sizeof(vis));
  cin >> n;
  for (int i = 1; i <= n; i++) {
    int x;
    cin >> x;
    a[i] = x;
    if (i == x) continue;
    G[i].push_back(x);
    G[x].push_back(i);
  }
  for (int i = 1; i <= n; i++) {
    if (a[i] == i && root == -1) root = i;
  }
  ans = 0;
  for (int i = 1; i <= n; i++) {
    if (!vis[i]) {
      cnt = 0;
      int ok = dfs(i, -1);
      ans++;
      if (ok && cnt == 1) a[i] = root;
      if (ok) a[i] = i;
      if (!ok) a[i] = root;
    }
  }
  cout << ans - 1 << endl;
  for (int i = 1; i < n; i++) {
    cout << a[i] << " ";
  }
  cout << a[n] << endl;
  return 0;
}
