#include "Encoder.h"
#include <vector>
#include <cstdio>
#include <set>
#define PB push_back
#define X first
#define Y second
using namespace std;
typedef long long ll;
typedef pair < int , int > pii;
const int N = 5e5 + 500;
vector < int > v[N];
int d0[N], d1[N], sub[N], dulj[N], nw = 0, n;
ll tko[N], jos[N];
set < pii > S;
void dfs_triv(int x,int lst){
sub[x] = 1;
for(int y : v[x]){
if(y != lst){
dfs_triv(y, x);
sub[x] += sub[y];
}
}
}
void glupi(int x){
if(x < n) return;
tko[d0[x]] = tko[x];
dulj[d0[x]] = dulj[x] + 1;
tko[d1[x]] = tko[x] + (1LL << dulj[x]);
dulj[d1[x]] = dulj[x] + 1;
glupi(d0[x]); glupi(d1[x]);
}
void dfs(int x, int lst){
for(int y : v[x]){
if(y == lst) continue;
S.insert({sub[y], y});
}
if((int)S.size() >= 2){
for(;S.size() > 1;){
d0[nw] = S.begin() -> Y; S.erase(S.begin());
d1[nw] = S.begin() -> Y; S.erase(S.begin());
sub[nw] = sub[d0[nw]] + sub[d1[nw]];
//printf("nw %d -> %d i %d\n", nw, d0[nw], d1[nw]);
S.insert({sub[nw], nw}); nw++;
}
if(!S.empty()){
int root = S.begin() -> Y;
tko[root] = tko[x]; dulj[root] = dulj[x];
glupi(root);
}
}
else{
for(int y : v[x]){
if(y == lst) continue;
tko[y] = tko[x]; dulj[y] = dulj[x] + 1;
}
}
S.clear();
for(int y : v[x])
if(y != lst) dfs(y, x);
//printf("x = %d tko = %lld dulj = %d\n", x, tko[x] + (1 << dulj[x]), dulj[x]);
Code(x, tko[x] + (1LL << dulj[x]));
}
void Encode(int nn, int u1[], int u2[]){
n = nn;
for(int i = 0;i + 1 < n;i++)
v[u1[i]].PB(u2[i]),
v[u2[i]].PB(u1[i]);
nw = n;
dfs_triv(0, 0);
dfs(0, 0);
}
#include "Device.h"
#include <cstdio>
typedef long long ll;
void InitDevice(){
return;
}
bool dijete(ll A, ll B){
int dulj_A = 0, dulj_B = 0;
for(;(1LL << dulj_A) <= A;dulj_A++);
for(;(1LL << dulj_B) <= B;dulj_B++);
if(dulj_A >= dulj_B) return 0;
//printf("dulj_A = %d dulj_B = %d\n", dulj_A, dulj_B);
//printf("Je li B %lld dijete od A %lld\n", B, A);
for(int i = 0;i + 1 < dulj_A;i++){
if((A & (1LL << i)) != (B & (1LL << i)))
return 0;
}
//printf("DA\n");
return 1;
}
int Answer(ll A, ll B)
{
if(dijete(B, A))
return 0;
if(dijete(A, B))
return 1;
return 2;
}
