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 N = 2e5 + 5;
long long par[N], vis[N], root, changes = 0;
void solve() {
  long long n;
  cin >> n;
  for (long long i = 1; i <= n; i++) {
    cin >> par[i];
    if (par[i] == i) root = i;
  }
  for (long long i = 1, T = 0; i <= n; i++) {
    if (!vis[i]) {
      T++;
      long long cur = i;
      while (!vis[cur]) {
        vis[cur] = T;
        cur = par[cur];
      }
      if (vis[cur] == T) {
        if (!root) {
          par[cur] = cur;
          root = cur;
          changes++;
        } else if (par[cur] != root) {
          par[cur] = root;
          changes++;
        }
      }
    }
  }
  cout << changes << '\n';
  for (long long i = 1; i <= n; i++) cout << par[i] << ' ';
}
signed main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  long long T = 1;
  for (long long i = 1; i <= T; i++) {
    solve();
  }
  cerr << "\nTime: " << clock() << " ms\n";
}
