# include <iostream>
using namespace std;

const int nmax = 100;
int fa[nmax];

void init(int n) {
    for (int i = 0; i <= n; i++)
        cin >> fa[i];
}

int findFa(int u) {
    if (fa[u] == u) return u;
    fa[u] = findFa(fa[u]);
    return fa[u];
}

void merge(int u, int v) {
    int fau = findFa(u);
    int fav = findFa(v);
    if (fau != fav) fa[u] = fav;
}