#include <bits/stdc++.h>
using namespace std;
#include "Alice.h"
#define LL long long
#define pii pair<int,int>
#define fi first 
#define se second
std::vector<std::pair<int, int>> Alice();
long long setN(int n);
const int N=5003;
int bel[N];
mt19937 rd(0x2477264);
vector<pii> Alice(){
    int n=4943;
    LL V=setN(4943);
    // LL V=4004;
    vector<pii> as;
    as.push_back({1,2});
    for(int l=3;l<=4943;l+=61){
        int now=l;
        for(int i=0;i<=60;i++){
            // cout<<now<<" ";
            bel[now]=i;
            now++;
        }
        // cout<<'\n';
    }
    shuffle(bel+3,bel+1+n,rd);
    for(int i=3;i<=n;i++){
        if(V&(1ll<<bel[i])) as.push_back({i,i-2});
        else as.push_back({i,i-1});
    }
    return as;
}
// int main(){
//     Alice();return 0;
// }

#include <bits/stdc++.h>
#include "Bob.h"
using namespace std;
#define LL long long
#define pii pair<int,int>
#define fi first 
#define se second
long long Bob(std::vector<std::pair<int, int>> V);
const int N=5e3+5;
bool vis[N];
int fa[N],ans[N],bel[N];
int n=4943;
vector<int> g[N];
void add(int x,int y){g[x].push_back(y);}
mt19937 rd(0x2477264);
LL Bob(vector<pii> as){
    for(auto [x,y]:as){
        if(x<y) fa[y]=x;
        else fa[x]=y;
    }
    for(int l=3;l<=n;l+=61){
        int now=l;
        for(int j=0;j<=60;j++){
            bel[now]=j;
            now++;
        }
    }
    shuffle(bel+3,bel+1+n,rd);
    LL rs=0;
    for(int i=3;i<=n;i++){
        if(fa[i]) ans[bel[i]]=i-fa[i]-1;
    }
    for(int j=0;j<=60;j++) rs+=1ll<<ans[j];
    return rs;
}
// int main(){
//     Bob(vector<pii>());
//     return 0;
// }