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;
int n, vis1[200007], a[200007], vis[200007], k, r, f;
vector<int> v[200007];
void DFS(int x) {
  cout << x << " ";
  vis[x] = 1e7;
  for (int i = 0; i < v[x].size(); i++) {
    if (!vis[v[x][i]]) DFS(v[x][i]);
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    v[i].push_back(a[i]);
  }
  for (int i = 1; i <= n; i++) {
    if (a[i] == i) {
      r = i;
      break;
    }
  }
  for (int i = 1; i <= n; i++) {
    int x = i;
    while (!vis1[x]) {
      if (x == r) f = 1;
      vis1[x] = i;
      x = a[x];
    }
    if (i != vis1[x]) continue;
    k++;
    if (f) {
      f = 0;
      continue;
    }
    a[x] = r;
  }
  cout << k - 1 << endl;
  for (int i = 1; i <= n; i++) cout << a[i] << " ";
}
