#include <bits/stdc++.h>
#include "Alice.h"
using namespace std;
vector<pair<int,int>> Alice() {
int N = 5000;
long long X = setN(N);
vector<pair<int, int>> arbre;
for(int i = 2;i <= N;i++) {
arbre.push_back({1 + X % (i - 1), i});
}
return arbre;
}
#include <bits/stdc++.h>
#include "Bob.h"
using namespace std;
__int128 modInv(__int128 a, __int128 b, __int128& u, __int128& v) {
if(a == 0) {
u = 0;
v = 1;
return b;
}
__int128 r = b / a;
__int128 g = modInv(b - r * a, a, u, v);
__int128 nu = v - r * u;
__int128 nv = u;
u = nu;
v = nv;
return g;
}
long long Bob(vector<pair<int, int>> aretes){
long long X = 0;
__int128 N = 1;
for(pair<int, int>& arete : aretes) {
int modX = arete.first - 1, p = arete.second - 1;
while(X % p != modX) {
X += N;
}
if(N >= 1e18) break;
}
return X;
}
