//*** Bismillah ***//
#pragma GCC optimize("O3")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("no-stack-protector")
#include <bits/stdc++.h>
using namespace std;
#if !defined(ONLINE_JUDGE) and !defined(EVAL)
#include "template/debug.h"
#else
#define d(x...)
#endif
#define fr first
#define er erase
#define sc second
#define in insert
#define ll long long
#define pb push_back
#define vll vector<ll>
#define pll pair<ll,ll>
#define vvll vector<vll>
#define vpll vector<pll>
#define len(x)(ll)x.size()
#define all(x)x.begin(),x.end()
const ll INF = 1e9;
const ll INFL = 1e18;
const ll MOD = 1e9+7;
// const ll MOD = 998244353;
const ll maxn = 5000+5;
ll n,m,k=0;
#include "Alice.h"
struct dsu{
vll d; ll comp;
dsu(ll _n){ d.assign(_n, -1); comp=_n; }
ll find(ll a){ return (d[a]<0 ? a : d[a] = find(d[a])); }
ll size(ll a){ return -d[find(a)]; }
ll merge(ll a, ll b){
a=find(a), b=find(b);
if(a==b) return 0;
if(-d[a] < -d[b]) swap(a, b);
d[a]+=d[b]; d[b]=a; comp--;
return 1;
}
};
ll p[maxn];
vector<pair<int, int>> Alice(){
n = 5000;
ll val = setN(n);
vector<pair<int,int>>v;
dsu D(5001);
for(ll i = 1; i < n; i ++) p[i] = i;
for(ll i = 1; i < n; i ++) for(ll j = 1; j < n; j ++){
ll x = p[i], y = p[j]+1;
if((x ^ y) > 60 or (val & 1ll << (x ^ y) - 1) == 0) continue;
if(D.find(x) != D.find(y)) D.merge(x, y), v.pb({x, y});
}
for(ll i = 1; i < n; i ++) if(D.find(i) != D.find(n)) D.merge(i, n), v.pb({i, n});
return v;
}
// void _(ll tt){
// }
// signed main(){
// ll tm=clock();
// cin.tie(0)->sync_with_stdio(0);
// ll t=1;
// cin>>t;
// for(ll tt=1;tt<=t;tt++){
// _(tt);
// }
// cerr<<"\n\033[1;31mTime: \033[1;30m" \
// <<(double)(clock()-tm)/1000000<<"\033[1;32m seconds\n";
// }
//*** Bismillah ***//
#pragma GCC optimize("O3")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("no-stack-protector")
#include <bits/stdc++.h>
using namespace std;
#if !defined(ONLINE_JUDGE) and !defined(EVAL)
#include "template/debug.h"
#else
#define d(x...)
#endif
#define fr first
#define er erase
#define sc second
#define in insert
#define ll long long
#define pb push_back
#define vll vector<ll>
#define pll pair<ll,ll>
#define vvll vector<vll>
#define vpll vector<pll>
#define len(x)(ll)x.size()
#define all(x)x.begin(),x.end()
const ll INF = 1e9;
const ll INFL = 1e18;
const ll MOD = 1e9+7;
// const ll MOD = 998244353;
const ll maxn = 1e5+5;
// ll n,m,k=0;
#include "Bob.h"
ll Bob(vector<pair<int, int>> v){
ll cv = 0;
for(auto [x, y] : v){
if(x == 5000 or y == 5000) continue;
cv |= 1ll<<(x^y)-1;
}
return cv;
}
// void _(ll tt){
// }
// signed main(){
// ll tm=clock();
// cin.tie(0)->sync_with_stdio(0);
// ll t=1;
// cin>>t;
// for(ll tt=1;tt<=t;tt++){
// _(tt);
// }
// cerr<<"\n\033[1;31mTime: \033[1;30m" \
// <<(double)(clock()-tm)/1000000<<"\033[1;32m seconds\n";
// }
