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 + 5;
int n, p[maxn], old[maxn], rt, vis[maxn];
void gen_root() {
  for (int i = 0; i < n; i++) {
    if (p[i] == i) {
      rt = i;
      return;
    }
  }
  int cur = 0;
  while (!vis[cur]) {
    vis[cur] = true;
    cur = p[cur];
  }
  p[cur] = cur;
  rt = cur;
}
void connect() {
  memset(vis, 0, sizeof(vis));
  for (int i = 0; i < n; i++) {
    if (p[i] == i) {
      p[i] = rt;
      vis[i] = true;
    }
  }
  for (int i = 0; i < n; i++) {
    if (!vis[i]) {
      int cur = i;
      while (vis[cur] == 0) {
        vis[cur] = 100 + i;
        cur = p[cur];
      }
      if (vis[cur] == 100 + i) {
        p[cur] = rt;
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> p[i];
    --p[i];
  }
  memcpy(old, p, sizeof(old));
  gen_root();
  connect();
  int res = 0;
  for (int i = 0; i < n; i++) {
    if (p[i] != old[i]) {
      ++res;
    }
  }
  cout << res << '\n';
  for (int i = 0; i < n; i++) {
    cout << p[i] + 1;
    if (i + 1 < n) {
      cout << ' ';
    }
  }
  cout << '\n';
  return 0;
}
