#include<bits/stdc++.h>
#include "Alice.h"
#define poly vector<int>
#define pa pair<int,int>
#define ull unsigned long long
#define mp make_pair
#define fi first
#define se second
#define ll long long
#define sz(x) ((int)(x.size()))
using namespace std;

//
namespace 
{
    const int n=5000,N=5005;
    mt19937_64 rnd(0724072407240724);
    int p[N],flip[N];
    void init()
    {
        for (int i=1;i<=n;i++) p[i]=i;
        shuffle(p+1,p+n+1,rnd);
        for (int i=1;i<=5000;i++)
            flip[i]=rnd()%2;
    }
}

std::vector<std::pair<int,int>> Alice(){
    init();
    std::vector<std::pair<int,int>>all;
    for (int i=1;i<4;i++)
        all.push_back(mp(p[i],p[i+1]));

    ll ans=setN(5000);

    for (int i=5;i<=5000;i++)
    {
        int x=i%60;
        int t=(ans>>x)&1;
        int o=rnd()%(i-1)+1;
        while (o%2!=t) o=rnd()%(i-1)+1;
        if (flip[i])
        {
            if (o!=1) o--;
            else o++;
        }
        all.push_back(mp(p[i],p[o]));
    }
    shuffle(all.begin(),all.end(),rnd);
    return all; 
}

#include<bits/stdc++.h>
#include "Bob.h"
#define poly vector<int>
#define pa pair<int,int>
#define mp make_pair
#define ull unsigned long long
#define fi first
#define se second
#define ll long long
#define sz(x) ((int)(x.size()))
using namespace std;

namespace 
{
    const int n=5000,N=5005;
    mt19937_64 rnd(0724072407240724);
    int p[N],flip[N];
    int cs[N];
    int ip[N];
    void init()
    {
        for (int i=1;i<=n;i++) p[i]=i;
        shuffle(p+1,p+n+1,rnd);
        for (int i=1;i<=n;i++) ip[p[i]]=i;
        for (int i=1;i<=5000;i++)
            flip[i]=rnd()%2;
    }
}

inline long long Ans(int x,int y)
{
    return 1ll*(x-1)*5000+y;
}
mt19937_64 rnd1(time(0));
long long Bob(std::vector<std::pair<int,int>> V){
    init();
    for (auto &[u,v]:V)
    {
        u=ip[u],v=ip[v];
        if (v>u) swap(u,v);
        // if (u>120)
        // cout<<u<<","<<v<<" "<<(u-120)%60<<" "<<(((v-1)%2)^flip[u])<<endl;
        if (u>=5) 
            cs[u%60]=((v)%2)^flip[u];
    }
    ll res=0;
    for (int i=0;i<60;i++)
        if (cs[i]) res+=(1ll<<i);
    return res;
}