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 NMAX = 222222;
vector<int> roots, newroots;
int vis[NMAX];
int p[NMAX];
int vcnt;
void query(int x) {
  while (1) {
    vis[x] = vcnt;
    int y = p[x];
    if (x == y) {
      roots.push_back(x);
      return;
    }
    if (vis[y] == vcnt) {
      p[x] = x;
      newroots.push_back(x);
      return;
    }
    if (vis[y]) return;
    x = y;
  }
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", p + i);
  for (int i = 1; i <= n; i++)
    if (!vis[i]) {
      vcnt++;
      query(i);
    }
  if (roots.empty()) {
    for (int i = 1; i < newroots.size(); i++) p[newroots[i]] = newroots[0];
    printf("%d\n", newroots.size());
    for (int i = 1; i <= n; i++) printf("%d ", p[i]);
  } else {
    for (int i = 1; i < roots.size(); i++) p[roots[i]] = roots[0];
    for (int i : newroots) p[i] = roots[0];
    printf("%d\n", (int)(roots.size() + newroots.size() - 1));
    for (int i = 1; i <= n; i++) printf("%d ", p[i]);
  }
}
