#include "Alice.h"
#include <bits/stdc++.h>
using namespace std;
int cnt=0;
vector<std::pair<int, int>> Alice()
{
   long long X,d;cnt++;
   int bit[5010],tr[5010],now=0,tnow=0,tcnt=0;
   pair<int,int> sid[5010];
   vector<int> ibit[70];
   vector<pair<int,int>> ret;
   queue<int> Q;
   for(int i=0;i<=60;i++) ibit[i].clear();
   mt19937 rd(114236+cnt);
   for(int i=3;i<=5000;i++)
   {
      bit[i]=tnow;
      tcnt++;
      if(tcnt==83&&tnow<59) tnow++,tcnt=0;
   }
   shuffle(bit+3,bit+5001,rd);
   for(int i=3;i<=5000;i++) tr[i]=rd()%2+1;
   for(int i=3;i<=5000;i++) ibit[bit[i]].push_back(i);
   X=setN(5000);
   while(!Q.empty()) Q.pop();
   while(X)
   {
      d=__lg(X);
      Q.push(d);
      X-=(1ll<<d);
   }
   for(int i=59;i>=0;i--)
   {
      if((!Q.empty())&&(i==Q.front()))
      {
         Q.pop();
         for(auto to:ibit[i]) sid[++now]={to,tr[to]};
         continue;
      }
      for(auto to:ibit[i]) sid[++now]={to,3-tr[to]};
   }
   shuffle(sid+1,sid+1+now,rd);ret.clear();ret.push_back({1,2});
   for(int i=1;i<=now;i++)
   {
      if(rd()%2==0) swap(sid[i].first,sid[i].second);
      ret.push_back({sid[i].first,sid[i].second});
   }
   return ret;
}

#include "Bob.h"
#include <bits/stdc++.h>
using namespace std;
int cnt2=0;
long long Bob(std::vector<std::pair<int, int>> V)
{
   cnt2++;
   int bit2[5010],tr2[5010],res2[70],tnow=0,tcnt=0;
   for(int i=0;i<=60;i++) res2[i]=0;
   mt19937 rd(114236+cnt2);
   for(int i=3;i<=5000;i++)
   {
      bit2[i]=tnow;
      tcnt++;
      if(tcnt==83&&tnow<59) tnow++,tcnt=0;
   }
   shuffle(bit2+3,bit2+5001,rd);
   for(int i=3;i<=5000;i++) tr2[i]=rd()%2+1;
   int m,x,y;
   for(int i=0;i<V.size();i++)
   {
      x=V[i].first;y=V[i].second;
      if(x<y) swap(x,y);
      if(x==2&&y==1) continue;
      if(tr2[x]==y) res2[bit2[x]]=1;
   }
   long long ans=0,dd=1;
   for(int i=0;i<=59;i++)
   {
      if(res2[i]) ans+=dd;
      dd*=2ll;
   }
   return ans;
}