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 mod1 = 998244353;
const long long mod2 = 1000000007;
int n, p[200005];
vector<int> cycles;
vector<int> s[200005];
int vis[200005];
vector<int> trees;
void find_tree(int i) {
  if (vis[i] == 1) {
    cycles.push_back(i);
    return;
  }
  vis[i] = 1;
  for (int j = 0; j < (s[i].size()); j++) {
    if (s[i][j] != i) find_tree(s[i][j]);
  }
  vis[i] = 2;
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> p[i];
    s[p[i]].push_back(i);
    if (i == p[i]) trees.push_back(i);
  }
  for (int i = 1; i <= n; i++)
    if (!vis[i]) find_tree(i);
  if (trees.size() != 0) {
    cout << trees.size() + cycles.size() - 1 << endl;
    for (int i = 1; i < trees.size(); i++) {
      p[trees[i]] = trees[0];
    }
    for (int i = 0; i < (cycles.size()); i++) {
      p[cycles[i]] = trees[0];
    }
  } else {
    cout << cycles.size() << endl;
    for (int i = 0; i < (cycles.size()); i++) {
      p[cycles[i]] = cycles[0];
    }
  }
  for (int i = 0; i < (n); i++) cout << p[i + 1] << ' ';
  cout << endl;
  return 0;
}
