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

using namespace std;
mt19937 rnd1 ( 114514 ), rnd2 ( 191981 ), rnd3 ( 998244 );

const int N = 5005;

int n = 5000;
int rd[N], dad1[N], dad2[N];
vector < pair < int, int > > e;

vector < pair < int, int > > Alice () {
	long long x = setN ( 5000 );
    for ( int i = 1; i <= n; i ++ ) {
        rd[i] = i;
    }
    srand ( rnd3 () );
    random_shuffle ( rd + 1, rd + 1 + n );
	for ( int i = 3; i <= n; i ++ ) {
        dad1[i] = rnd1 () % ( i - 1 ) + 1;
        dad2[i] = rnd2 () % ( i - 1 ) + 1;
        while ( dad2[i] == dad1[i] ) {
            dad2[i] = rnd2 () % ( i - 1 ) + 1;
        }
    }
    for ( int i = 2; i <= 80; i ++ ) {
        e.push_back ( { i, rnd3 () % ( i - 1 ) + 1 } );
    }
    int len = 80;
    for ( int i = 1; i <= 80; i ++ ) {
        for ( int j = 0; j <= 60; j ++ ) {
            len ++;
            if ( ( x >> ( long long ) j ) & 1ll ) {
                e.push_back ( { len, dad1[len] } );
            }
            else {
                e.push_back ( { len, dad2[len] } );
            }
        }
    }
    for ( int i = len + 1; i <= 5000; i ++ ) {
        e.push_back ( { i, rnd3 () % ( i - 1 ) + 1 } );
    }
    vector < pair < int, int > > ans;
    for ( pair < int, int > tmp : e ) {
        ans.push_back ( { rd[tmp.first], rd[tmp.second] } );
    }
    return ans;
}

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

using namespace std;
mt19937 rndd1 ( 114514 ), rndd2 ( 191981 ), rndd3 ( 998244 );

const int N = 5005;

int nn = 5000;
int rdd[N], dadd1[N], dadd2[N], id[N];
int mp[N][N], p[N];

long long Bob ( vector < pair < int, int > > e ) {
    for ( int i = 1; i <= nn; i ++ ) {
        rdd[i] = i;
    }
    srand ( rndd3 () );
    random_shuffle ( rdd + 1, rdd + 1 + nn );
    for ( int i = 1; i <= nn; i ++ ) {
        id[rdd[i]] = i;
    }
	for ( int i = 3; i <= nn; i ++ ) {
        dadd1[i] = rndd1 () % ( i - 1 ) + 1;
        dadd2[i] = rndd2 () % ( i - 1 ) + 1;
        while ( dadd2[i] == dadd1[i] ) {
            dadd2[i] = rndd2 () % ( i - 1 ) + 1;
        }
    }
    for ( pair < int, int > tmp : e ) {
        mp[id[tmp.first]][id[tmp.second]] = mp[id[tmp.second]][id[tmp.first]] = 1;
    }
    int len = 80;
    for ( int i = 1; i <= 80; i ++ ) {
        for ( int j = 0; j <= 60; j ++ ) {
            len ++;
            if ( mp[len][dadd1[len]] ) {
                p[j] = 1;
            }
        }
    }
    long long x = 0;
    for ( int i = 0; i <= 60; i ++ ) {
        if ( p[i] ) {
            x += 1ll << ( long long ) i;
        }
    }
	return x;
}