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

using namespace std;
mt19937 rnd ( 191981 );

const int N = 5005;

int n = 4980;
int rd[N], tmp[N];
vector < pair < int, int > > e;

vector < int > rnd_2 ( int lim ) {
	for ( int i = 1; i <= lim; i ++ ) {
		tmp[i] = i;
	}
	for ( int i = 1; i <= lim; i ++ ) {
		swap ( tmp[i], tmp[rnd () % lim + 1] );
	}
	vector < int > res;
	for ( int i = 1; i <= 2; i ++ ) {
		res.push_back ( tmp[i] );
	}
	return res;
}

vector < pair < int, int > > Alice () {
	long long x = setN ( 4980 );
	for ( int i = 1; i <= n; i ++ ) {
		rd[i] = i;
	}
	for ( int i = 1; i <= n; i ++ ) {
		swap ( rd[i], rd[rnd () % n + 1] );	
	}
    for ( int i = 101, j = 0; i <= 4980, j < 61; i += 80, j ++ ) {
        for ( int k = i; k <= i + 80 - 1; k ++ ) {
            vector < int > tmp = rnd_2 ( i - 1 );
            if ( ( x >> ( long long ) j ) & 1ll ) {
                e.push_back ( { rd[k], rd[tmp[0]] } );
                // cout << rd[k] << " " << rd[tmp[0]] << '\n';
            }
            else {
                e.push_back ( { rd[k], rd[tmp[1]] } );
            }
        }
        // cout << '\n';
    }
    for ( int i = 2; i <= 100; i ++ ) {
        e.push_back ( { rd[i], rd[rnd () % ( i - 1 ) + 1] } );
    }
    random_shuffle ( e.begin (), e.end () );
	return e;
}

/*
4757 1957
4421 2446
1320 3971
3657 2747
4395 3415
2167 1238
2677 923
3749 1403
589 3085
2200 611
2783 923
2044 1152
2327 4256
1264 4224
3960 4879
251 242
446 2720
1677 3306
4040 4099
1580 1383
402 121
972 3274
533 2446
840 1604
604 22
942 2747
4698 3971
115 1499
4094 3059
283 4472
847 2446
3676 3402
1491 1499
2974 2287
2879 1002
2461 2446
849 1630
2570 574
1841 4656
2433 4099
4575 2107
1882 1238
2768 923
603 1002
4627 1499
3665 3085
3220 4077
2242 1781
3286 4924
1111 3028
316 611
2810 2832
146 4529
1662 4099
3800 591
4043 4224
1899 2950
35 4472
3637 591
4929 2107
2437 1152
2369 3585
969 3274
931 923
1300 592
262 2266
38 4396
664 2107
465 2522
1411 2731
3308 4077
1664 984
4801 2088
976 4224
207 2522
4606 4924
1307 3475
3154 4099
16 1002
1059 2720

2472 3971
1907 262
226 984
1405 242
3731 2495
2866 1152
1033 452
193 2832
4126 1755
3636 3220
427 242
4599 1307
3570 3971
3219 3585
319 1580
4561 4099
902 2974
328 2950
1352 1499
2491 591
288 771
4139 1459
322 709
868 849
1196 2266
4823 589
3885 2522
2644 2974
4242 574
2099 38
3792 3633
3626 2495
4948 2879
130 1152
2873 3960
4532 4656
4168 1238
4538 603
2536 1085
3584 2287
2300 4575
508 3085
2053 604
3367 976
912 972
80 1152
1988 3308
2822 1300
4145 2731
4505 3402
3442 2720
13 1403
3524 2044
1953 976
434 2747
1345 2621
2301 4043
965 4395
4524 2287
2791 96
37 1459
2295 283
2230 4924
4123 603
394 1383
4756 1781
879 4803
799 3220
324 4256
2148 1059
542 916
1513 4094
881 3770
1053 452
1014 591
2065 4879
650 4224
1775 4929
3918 1307
4790 283
*/

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

using namespace std;
mt19937 rndd ( 191981 );

const int N = 5005;

int nn = 4980;
int rdd[N], tmpp[N];
set < pair < int, int > > mp;

vector < int > rndd_2 ( int lim ) {
	for ( int i = 1; i <= lim; i ++ ) {
		tmpp[i] = i;
	}
	for ( int i = 1; i <= lim; i ++ ) {
		swap ( tmpp[i], tmpp[rndd () % lim + 1] );
	}
	vector < int > res;
	for ( int i = 1; i <= 2; i ++ ) {
		res.push_back ( tmpp[i] );
	}
	return res;
}

long long Bob ( vector < pair < int, int > > e ) {
	for ( pair < int, int > it : e ) {
		mp.insert ( it );
		mp.insert ( { it.second, it.first } );
	}
	for ( int i = 1; i <= nn; i ++ ) {
		rdd[i] = i;
	}
	for ( int i = 1; i <= nn; i ++ ) {
		swap ( rdd[i], rdd[rndd () % nn + 1] );	
	}
	long long x = 0;
	for ( int i = 101, j = 0; i <= 4980, j < 61; i += 80, j ++ ) {
        long long val = -1;
        for ( int k = i; k <= i + 80 - 1; k ++ ) {
            vector < int > tmpp = rndd_2 ( i - 1 );
            if ( j < 2 ) {
                cout << rdd[k] << " " << rdd[tmpp[0]] << '\n';
            }
            if ( mp.find ( { rdd[k], rdd[tmpp[0]] } ) != mp.end () ) {
                val = 1;
                break;
            }
            if ( mp.find ( { rdd[k], rdd[tmpp[1]] } ) != mp.end () ) {
                val = 0;
                break;
            }
        }
        cout << '\n';
        if ( val != -1 ) {
            // cout << j << " " << val << '\n';
            x += ( 1ll << ( long long ) j );
        }
    }
	return x;
}