/*
 *                                                     __----~~~~~~~~~~~------___
 *                                    .  .   ~~//====......          __--~ ~~
 *                    -.            \_|//     |||\\  ~~~~~~::::... /~
 *                 ___-==_       _-~o~  \/    |||  \\            _/~~-
 *         __---~~~.==~||\=_    -_--~/_-~|-   |\\   \\        _/~
 *     _-~~     .=~    |  \\-_    '-~7  /-   /  ||    \      /
 *   .~       .~       |   \\ -_    /  /-   /   ||      \   /
 *  /  ____  /         |     \\ ~-_/  /|- _/   .||       \ /
 *  |~~    ~~|--~~~~--_ \     ~==-/   | \~--===~~        .\
 *           '         ~-|      /|    |-~\~~       __--~~
 *                       |-~~-_/ |    |   ~\_   _-~            /\
 *                            /  \     \__   \/~                \__
 *                        _--~ _/ | .-~~____--~-/                  ~~==.
 *                       ((->/~   '.|||' -_|    ~~-/ ,              . _||
 *                                  -_     ~\      ~~---l__i__i__i--~~_/
 *                                  _-~-__   ~)  \--______________--~~
 *                                //.-~~~-~_--~- |-------~~~~~~~~
 *                                       //.-~~~--\
 *                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 *
 *                               神兽保佑            永无BUG
 */

/*
 * @Description: I want to be the weakest vegetable in the world!
 * @Author: I.Z.
 */
#include<bits/stdc++.h>
#include "Alice.h"
using namespace std;
#define MOD         998244353
#define speMOD      2933256077ll
#define ll          long long
#define pii         pair<int,int>
#define all(v)      v.begin(),v.end()
#define pb          push_back
#define REP(i,b,e)  for(int i=(b);i<(int)(e);++i)
#define over(x)     {cout<<(x)<<endl;return;}
#define lowbit(x)   ((x)&(-(x)))
#define cntbit(x)   __builtin_popcount(x)
#define rf(v)       shuffle(all(v),sd);
#define deal(v)     sort(all(v));v.erase(unique(v.begin(),v.end()),v.end())
#define lbound(v,x) lower_bound(all(v),x)-v.begin()
int qpow(int a,int b,int m=MOD,int res=1){
	a%=m;
	while(b>0)res=(b&1)?(res*a%m):(res),a=a*a%m,b>>=1;
	return res;
}
string YN(bool x,string Y="Yes",string N="No") {
	if(x){
		return Y;
	} else {
		return N;
	}
}
int exgcd(int x,int y,int &a,int &b){
	if(y==0){
		a=1;b=0;
		return x;
	}
	int d=exgcd(y,x%y,a,b);
	int z=b;
	b=a-b*(x/y);
	a=z;
	return d;
}
int _x_,_y_;
inline int inverse(int x,int y=MOD){
	exgcd(x,y,_x_,_y_);
	return (_x_+y)%y;
}
int fac[2000005],inv[2000005];
void init(int n){
	fac[0]=inv[0]=1;
	REP(i,1,n+1)fac[i]=fac[i-1]*i%MOD;
	inv[n]=qpow(fac[n],MOD-2);
	for(int i=n-1;i>=1;--i)inv[i]=inv[i+1]*(i+1)%MOD;
}
int binom(int x,int y){
	return x<y||y<0? 0:fac[x]*inv[y]%MOD*inv[x-y]%MOD;
}
vector<pii>Alice(){
	ll res=setN(4982);
	vector<pii>a;
	vector<int>p;
	int n=4982;
	REP(i,0,n)p.pb(i+1);
	mt19937 sd(993244853),sd2(38517893),sd3(10294);
	uniform_int_distribution<ll>R(0ll,1'000'000'000'000'000'000ll);
	shuffle(all(p),sd);
	vector<int>p2;
	REP(i,0,60)p2.pb(i);
	a.pb({p[0],p[1]});
	REP(i,0,(n-2)/60){
		mt19937 sd4(R(sd3));
		shuffle(all(p2),sd4);
		REP(j,0,60){
			uniform_int_distribution<int>rd(0,i*60+j);
			a.pb({p[rd(sd2)+((res>>p2[j])&1)],p[i*60+j+2]});
		}
	}
//	shuffle(all(a),sd2());
	shuffle(all(p),sd3);
	vector<pii>b;
	for(auto i:p)if(i-1<(int)a.size())b.pb(a[i-1]);
	return b;
}

/*
 *                                                     __----~~~~~~~~~~~------___
 *                                    .  .   ~~//====......          __--~ ~~
 *                    -.            \_|//     |||\\  ~~~~~~::::... /~
 *                 ___-==_       _-~o~  \/    |||  \\            _/~~-
 *         __---~~~.==~||\=_    -_--~/_-~|-   |\\   \\        _/~
 *     _-~~     .=~    |  \\-_    '-~7  /-   /  ||    \      /
 *   .~       .~       |   \\ -_    /  /-   /   ||      \   /
 *  /  ____  /         |     \\ ~-_/  /|- _/   .||       \ /
 *  |~~    ~~|--~~~~--_ \     ~==-/   | \~--===~~        .\
 *           '         ~-|      /|    |-~\~~       __--~~
 *                       |-~~-_/ |    |   ~\_   _-~            /\
 *                            /  \     \__   \/~                \__
 *                        _--~ _/ | .-~~____--~-/                  ~~==.
 *                       ((->/~   '.|||' -_|    ~~-/ ,              . _||
 *                                  -_     ~\      ~~---l__i__i__i--~~_/
 *                                  _-~-__   ~)  \--______________--~~
 *                                //.-~~~-~_--~- |-------~~~~~~~~
 *                                       //.-~~~--\
 *                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 *
 *                               神兽保佑            永无BUG
 */

/*
 * @Description: I want to be the weakest vegetable in the world!
 * @Author: I.Z.
 */
#include<bits/stdc++.h>
#include "Bob.h"
using namespace std;
#define MOD         998244353
#define speMOD      2933256077ll
#define ll          long long
#define pii         pair<int,int>
#define all(v)      v.begin(),v.end()
#define pb          push_back
#define REP(i,b,e)  for(int i=(b);i<(int)(e);++i)
#define over(x)     {cout<<(x)<<endl;return;}
#define lowbit(x)   ((x)&(-(x)))
#define cntbit(x)   __builtin_popcount(x)
#define rf(v)       shuffle(all(v),sd);
#define deal(v)     sort(all(v));v.erase(unique(v.begin(),v.end()),v.end())
#define lbound(v,x) lower_bound(all(v),x)-v.begin()
mt19937 sd(random_device{}());
int qpow(int a,int b,int m=MOD,int res=1){
	a%=m;
	while(b>0)res=(b&1)?(res*a%m):(res),a=a*a%m,b>>=1;
	return res;
}
string YN(bool x,string Y="Yes",string N="No") {
	if(x){
		return Y;
	} else {
		return N;
	}
}
int exgcd(int x,int y,int &a,int &b){
	if(y==0){
		a=1;b=0;
		return x;
	}
	int d=exgcd(y,x%y,a,b);
	int z=b;
	b=a-b*(x/y);
	a=z;
	return d;
}
int _x_,_y_;
inline int inverse(int x,int y=MOD){
	exgcd(x,y,_x_,_y_);
	return (_x_+y)%y;
}
int fac[2000005],inv[2000005];
void init(int n){
	fac[0]=inv[0]=1;
	REP(i,1,n+1)fac[i]=fac[i-1]*i%MOD;
	inv[n]=qpow(fac[n],MOD-2);
	for(int i=n-1;i>=1;--i)inv[i]=inv[i+1]*(i+1)%MOD;
}
int binom(int x,int y){
	return x<y||y<0? 0:fac[x]*inv[y]%MOD*inv[x-y]%MOD;
}
bool cmp(pii x,pii y){return x.second<y.second;}
ll Bob(vector<pii>a){
	vector<int>p,q,p2;
	REP(i,0,60)p2.pb(i);
	int n=4982;
	REP(i,0,n)q.pb(i+1);
	mt19937 sd(993244853),sd2(38517893),sd3(10294);
	uniform_int_distribution<ll>R(0ll,1'000'000'000'000'000'000ll);
	shuffle(all(q),sd);
	REP(i,0,n+1)p.pb(0);
	REP(i,0,n)p[q[i]]=i;
	REP(i,0,a.size())a[i].first=p[a[i].first],a[i].second=p[a[i].second];
	vector<int>fa(n+1,-1);
	REP(i,0,a.size())if(a[i].first>a[i].second)swap(a[i].first,a[i].second);
	for(auto i:a)fa[i.second]=i.first;
	vector<int>res(60);
	REP(i,0,(n-2)/60){
		mt19937 sd4(R(sd3));
		shuffle(all(p2),sd4);
		REP(j,0,60){
			uniform_int_distribution<int>rd(0,i*60+j);
			int cur=rd(sd2);
			if(fa[i*60+j+2]!=-1){
				if(cur==fa[i*60+j+2])res[p2[j]]=0;
				else res[p2[j]]=1;
			}
		}
	}
	ll ret=0;
	REP(i,0,60)if(res[i])ret|=(1ll<<i);
	return ret;
}