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 N = 200200;
int a[N], cmp, ans;
vector<int> adj[N];
queue<int> q;
int visited[N];
void dfs(int u, int par = -1) {
  visited[u] = cmp;
  for (int v : adj[u]) {
    if (!visited[v]) {
      dfs(v, u);
    } else if (visited[v] == cmp) {
      q.push(v);
    }
  }
}
int main() {
  int n, x, root = -1;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &x);
    a[i] = x;
    adj[i].push_back(x);
    if (x == i) {
      root = i;
    }
  }
  for (int i = 1; i <= n; i++) {
    if (!visited[i]) {
      ++cmp;
      dfs(i);
    }
  }
  if (root == -1) {
    root = q.front();
    q.pop();
    a[root] = root;
    ++ans;
  }
  while (!q.empty()) {
    a[q.front()] = root;
    if (q.front() != root) ans++;
    q.pop();
  }
  printf("%d\n", ans);
  for (int i = 1; i <= n; i++) {
    printf("%d ", a[i]);
  }
  printf("\n");
  return 0;
}
