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;
template <typename T>
T next_int() {
  T x = 0, p = 1;
  char ch;
  do {
    ch = getchar();
  } while (ch <= ' ');
  if (ch == '-') {
    p = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + (ch - '0');
    ch = getchar();
  }
  return x * p;
}
const int max_n = (int)1e6 + 227 + 1;
const int max_int = (int)1e9 + 227 + 1;
const int mod = (int)1e9 + 7;
vector<vector<int> > a;
vector<bool> used;
vector<int> lol;
void go(int v, int pr) {
  if (used[v]) return;
  used[v] = 1;
  for (int i = 0; i < a[v].size(); i++) {
    if (a[v][i] == pr) continue;
    if (used[a[v][i]]) {
      lol.back() = v;
    }
    go(a[v][i], v);
  }
}
int main() {
  int n = next_int<int>();
  int k = 0;
  vector<int> p(n);
  a.resize(n);
  for (int i = 0; i < n; i++) {
    p[i] = next_int<int>() - 1;
    k += (p[i] == i);
    a[p[i]].push_back(i);
    a[i].push_back(p[i]);
  }
  used.resize(n);
  for (int i = 0; i < n; i++) used[i] = 0;
  for (int i = 0; i < n; i++) {
    if (!used[i]) lol.push_back(-1);
    go(i, -1);
  }
  int pe = -1;
  for (int i = 0; i < lol.size(); i++) {
    if (p[lol[i]] == lol[i]) pe = i;
  }
  cout << (int)lol.size() - (pe != -1) << "\n";
  if (pe == -1) {
    p[lol[0]] = lol[0];
    pe = 0;
  }
  for (int i = 0; i < lol.size(); i++) {
    if (i == pe) continue;
    p[lol[i]] = lol[pe];
  }
  for (int i = 0; i < n; i++) cout << p[i] + 1 << " ";
  puts("");
}
