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;
long long s[200005];
long long p[200005];
long long np[200005];
long long n;
bool cmp(long long a, long long b) { return abs(p[a] - a) < abs(p[b] - b); }
signed main() {
  cin >> n;
  for (long long i = (0); i < (n); i++) {
    cin >> p[i];
    p[i]--;
    np[i] = p[i];
  }
  vector<long long> v;
  for (long long i = (0); i < (n); i++) {
    set<long long> u;
    long long j = i;
    for (; !s[j]; j = p[j]) {
      u.insert(j);
      s[j] = 1;
    }
    if (u.count(j)) v.push_back(j);
  }
  sort(v.begin(), v.end(), cmp);
  for (long long i : v) np[i] = v[0];
  long long ans = 0;
  for (long long i : v) ans += (p[i] != np[i]);
  cout << ans << '\n';
  for (long long i = (0); i < (n); i++) cout << np[i] + 1 << ' ';
  return 0;
}
