#ifndef _Pbrngw_
#include "Alice.h"
#endif // _Pbrngw_
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define FORD(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define fi first
#define se second
#define pb push_back
#define ALL(a) (a).begin(), (a).end()
#define task "kbsiudthw"
typedef vector<int> vi;
typedef pair<int32_t, int32_t> ii;
typedef pair<int, ii> pii;
const int N = 1e5 + 5;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 2277;
mt19937_64 rd(time(0));
int Rand(int l, int r){
return l + (rd()%(r - l + 1) + r - l + 1)%(r - l + 1);
}
vector<ii> Alice(){
int x = setN(5000);
vector<ii> edges;
edges.pb({1, 2});
FOR (i, 3, 5000){
int t = (i - 3) % 25;
int c = (x>>t)&1;
int par = Rand(1, i - 1);
if ((par & 1) != (c & 1)){
if (par + 1 >= i) par--;
else par++;
}
edges.pb({par, i});
}
return edges;
}
#ifdef _Pbrngw_
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
if (fopen(task".inp", "r")){
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
return 0;
}
#endif // _Pbrngw_
#ifndef _Pbrngw_
#include "Bob.h"
#endif // _Pbrngw_
#include<bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define FORD(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define fi first
#define se second
#define pb push_back
#define ALL(a) (a).begin(), (a).end()
#define task "kbsiudthw"
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<int, ii> pii;
const int N = 1e5 + 5;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 2277;
long long Bob(vector<ii> V){
long long ans = 0;
for (ii &x : V){
if (x.se <= 2) continue;
int c = (x.se - 3)%25;
if (x.fi&1) ans |= (1ll<<c);
}
return ans;
}
#ifdef _Pbrngw_
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
if (fopen(task".inp", "r")){
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
return 0;
}
#endif // _Pbrngw_
