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 NMAX = 2e5 + 5;
int n, answer, root;
int parent[NMAX], dad[NMAX], ans[NMAX];
bool vis[NMAX], vis2[NMAX];
vector<int> roots, adj[NMAX];
void dfs(int node) {
  vis[node] = true;
  if (!vis[parent[node]]) {
    dfs(parent[node]);
  } else {
    if (root == 0) {
      root = node;
      ans[node] = node;
      ++answer;
    } else if (parent[node] != node) {
      if (ans[node] == root) --answer;
      ans[node] = root;
      ++answer;
    }
  }
}
void dfs2(int node) {
  vis[node] = true;
  for (int &x : adj[node]) {
    dfs(x);
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    cin >> parent[i];
    if (parent[i] == i) {
      root = i;
    }
    adj[parent[i]].push_back(i);
    ans[i] = parent[i];
  }
  for (int i = 1; i <= n; ++i) {
    if (!vis[i]) {
      dfs(i);
    }
  }
  cout << answer << '\n';
  for (int i = 1; i <= n; ++i) {
    cout << ans[i] << ' ';
  }
  return 0;
}
