#include "Alice.h"
#include <bits/stdc++.h>
using namespace std;

#define REP(i, j, k) for (int i = j; i < (k); i++)
#define RREP(i, j, k) for (int i = j; i >= (k); i--)

template <typename T>
bool mnto(T &a, const T &b) {return b < a ? a = b, 1 : 0;}
template <typename T>
bool mxto(T &a, const T &b) {return b > a ? a = b, 1 : 0;}

typedef long long ll;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
#define pb push_back
#define SZ(x) ((int) x.size())
#define ALL(x) x.begin(), x.end()
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<ll> vll;
typedef tuple<int, int, int> iii;
typedef tuple<ll, ll, ll> lll;
typedef vector<iii> viii;
typedef vector<lll> vlll;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

namespace {
    const int BLK = 83;
    const int MAXL = 60;
    //const int BLK = 11;
    //const int MAXL = 3;
    const int n = BLK * MAXL;
    mt19937 rnd(38205);
    int id[n + 5];
}

vii Alice() {
    ll x = setN(n);
    iota(id, id + n, 1);
    shuffle(id, id + n, rnd);
    vii eg;
    REP (k, 0, MAXL) {
        if (x >> k & 1) {
            if (k) {
                eg.pb({id[k * BLK], id[k * BLK - 1]});
            }
            REP (i, 1, BLK) {
                eg.pb({id[k * BLK + i - 1], id[k * BLK + i]});
            }
        } else {
            if (k) {
                eg.pb({id[k * BLK + 1], id[k * BLK - 1]});
            }
            RREP (b, 1, 0) {
                for (int i = b; i + 2 < BLK; i += 2) {
                    eg.pb({id[k * BLK + i], id[k * BLK + i + 2]});
                }
                if (b) {
                    eg.pb({id[(k + 1) * BLK - 2], id[k * BLK]});
                }
            }
        }
    }
    shuffle(ALL(eg), rnd);
    for (auto &[u, v] : eg) {
        if (rnd() & 1) {
            swap(u, v);
        }
    }
    return eg;
}

#include <vector>
#include <bits/stdc++.h>
using namespace std;

#define REP(i, j, k) for (int i = j; i < (k); i++)
#define RREP(i, j, k) for (int i = j; i >= (k); i--)

template <typename T>
bool mnto(T &a, const T &b) {return b < a ? a = b, 1 : 0;}
template <typename T>
bool mxto(T &a, const T &b) {return b > a ? a = b, 1 : 0;}

typedef long long ll;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
#define pb push_back
#define SZ(x) ((int) x.size())
#define ALL(x) x.begin(), x.end()
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<ll> vll;
typedef tuple<int, int, int> iii;
typedef tuple<ll, ll, ll> lll;
typedef vector<iii> viii;
typedef vector<lll> vlll;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

namespace {
    const int BLK = 83;
    const int MAXL = 60;
    //const int BLK = 11;
    //const int MAXL = 3;
    const int n = BLK * MAXL;
    mt19937 rnd(38205);
    int id[n + 5];
    int in[n + 5];
    int deg[n + 5];
}

ll Bob(vii eg){
    iota(id, id + n, 1);
    shuffle(id, id + n, rnd);
    REP (i, 1, n + 1) {
        in[i] = 0;
        deg[i] = 0;
    }
    ll ans = 0;
    REP (k, 0, MAXL) {
        REP (i, k * BLK, (k + 1) * BLK) {
            in[id[i]] = i + 1;
        }
        int cnt = 0;
        bool on;
        for (auto [u, v] : eg) {
            if (in[u] && in[v]) {
                if (abs(in[u] - in[v]) == 1) {
                    on = 1;
                } else {
                    on = 0;
                }
                cnt++;
            }
        }
        assert(cnt);
        if (on) {
            ans += 1ll << k;
        }
        REP (i, k * BLK, (k + 1) * BLK) {
            in[id[i]] = 0;
        }
    }
    return ans;
}