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;
vector<int> graph[200001];
vector<bool> vis(200001, false);
int var;
void dfs(int s) {
  var = s;
  vis[s] = true;
  for (auto it : graph[s]) {
    if (!vis[it]) dfs(it);
  }
}
int main() {
  int n, root = 0;
  cin >> n;
  int p[n + 1];
  for (int i = 1; i <= n; i++) {
    cin >> p[i];
    if (i == p[i]) root = i;
    graph[i].push_back(p[i]);
    graph[p[i]].push_back(i);
  }
  vector<int> v;
  for (int i = 1; i <= n; i++) {
    if (!vis[i]) {
      dfs(i);
      v.push_back(var);
    }
  }
  for (int i = 0; i < v.size(); i++) {
    if (i != v.size() - 1) p[v[i]] = root;
  }
  if (root == 0) {
    cout << "1\n";
    for (int i = 1; i <= n; i++) {
      if (p[p[i]] == i) {
        root = p[i];
        p[p[i]] = root;
      }
    }
  } else
    cout << v.size() - 1 << endl;
  for (int i = 1; i <= n; i++) cout << p[i] << " ";
}
