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 maxn = 2e5 + 10;
const int mod = 998244353;
const int inf = 0x3fffffff;
int n, p[maxn], father[maxn], b[maxn];
void init() {
  for (int i = 1; i <= n; i++) father[i] = i;
}
int find_father(int x) { return father[x] == x ? x : find_father(father[x]); }
void Union(int a, int b) {
  int faA = find_father(a);
  int faB = find_father(b);
  if (faA != faB) father[faA] = faB;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  init();
  int root = 0;
  for (int i = 1; i <= n; i++) {
    cin >> p[i];
    Union(i, p[i]);
    if (i == p[i]) root = i;
  }
  int k = find_father(root);
  int cnt = 0;
  for (int i = 1; i <= n; i++) {
    int t = find_father(i);
    if (b[t] == 0) {
      cnt++;
      if (t != k) p[t] = root;
    }
    b[t]++;
  }
  bool flag = false;
  for (int i = 1; i <= n; i++) {
    if (p[i] == 0) {
      p[i] = i;
      flag = true;
    }
  }
  if (flag)
    cout << cnt;
  else
    cout << cnt - 1;
  cout << endl;
  for (int i = 1; i <= n; i++) cout << p[i] << " ";
  return ~~(0 - 0);
}
