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, a[200005], c[100005], cnt;
vector<int> g[200005];
vector<int> fc[200005];
vector<int> v;
void dfs(int i) {
  if (c[i] != 0) return;
  c[i] = cnt;
  fc[cnt].push_back(i);
  for (int j = 0; j < (g[i].size()); j++) dfs(g[i][j]);
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    g[i].push_back(a[i]);
    g[a[i]].push_back(i);
  }
  for (int i = 1; i <= n; i++) {
    if (c[i] != 0) continue;
    cnt++;
    dfs(i);
    int p = fc[cnt][0];
    for (int j = 0; j < (fc[cnt].size()); j++) p = a[p];
    v.push_back(p);
  }
  int s = -1;
  for (int i = 1; i <= n; i++) {
    if (a[i] == i) {
      cnt--;
      s = i;
      break;
    }
  }
  for (int i = 0; i < (v.size()); i++)
    if (v[i] != s) a[v[i]] = s;
  cout << cnt << endl;
  for (int i = 1; i <= n; i++) {
    cout << a[i];
    cout << ((i == n) ? '\n' : ' ');
  }
  return 0;
}
