#include <bits/extc++.h>
#include "Alice.h"
#include "Bob.h"
#define all(v) v.begin(), v.end()
#define zip(v) sort(all(v)), v.erase(unique(all(v)), v.end())
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pint;
typedef pair<ll, ll> pll;
using namespace __gnu_pbds;
template<class T> using PBDS = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> using multiPBDS = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
vector<pint> Alice(){
ll x = setN(5000);
vector<pint> edges;
for(int i=2;i<=5000;i++) edges.push_back({x%(i-1)+1,i});
return edges;
}
#include <bits/extc++.h>
#include "Alice.h"
#include "Bob.h"
#define all(v) v.begin(), v.end()
#define zip(v) sort(all(v)), v.erase(unique(all(v)), v.end())
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pint;
typedef pair<ll, ll> pll;
using namespace __gnu_pbds;
template<class T> using PBDS = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> using multiPBDS = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll Bob(vector<pint> edges){
ll ans=0, lc=1;
for(auto& [u, v]:edges) {
//v-1로 나눈 나머지가 u-1..
u--, v--;
while(ans%v!=u) ans+=lc;
lc*=v/__gcd(lc,(ll)v);
}
return ans;
}
