#include "Alice.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

mt19937 rng(92783458);

int p[5001];

int get(int x){
    if(p[x] == x) return x;
    return p[x] = get(p[x]);
}

vector<pair<int,int>> Alice(){
    vector<pair<int, int>> edge, ans;
    int n = 5000;
    ll x = setN(n);
    for(int i=1;i<=n;i++){
        p[i] = i;
    }
    for(int i=1;i<=n;i++){
        for(int j=i+1;j<=n;j++){
            if((x & (1ll << ((i + j) % 60)))){
                edge.push_back({i, j});
            }
        }
    }
    shuffle(edge.begin(), edge.end(), rng);
    for(auto [x, y]:edge){
        if(get(x) != get(y)){
            ans.push_back({x, y});
            p[get(x)] = get(y);
        }
    }
    return ans;
}

#include <bits/stdc++.h>
#include "Bob.h"

using namespace std;
typedef long long ll;

long long Bob(std::vector<std::pair<int,int>> edge){
    ll ans = 0;
    for(auto [x, y]:edge){
        ans |= (1ll << (x + y));
    }
    return ans;
}