int find(int x) {
    int t = fa[x];
    if (fa[x] != x) {
        fa[x] = find(fa[x]);/////////////////////////////////
        flag[x] = (flag[x] + flag[t] + 1) % 3 - 1;
    }
    return fa[x];
}