#include <bits/stdc++.h>
#include "interactive.h"
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>*/
#define ll long long
#define ll1 long long
#define ull unsigned long long
#define dou long double
#define str string
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vbool vector<bool>
#define vstr vector<str>
#define vvll vector<vll>
#define pb push_back
#define pf push_front
//#define endl "\n"
#define fr first
#define se second
// #define sortcmp(a) sort(a.begin(), a.end(), cmp)
#define sort(a) sort(a.begin(), a.end())
#define all(a) a.begin(), a.end()
#define reverse(a) reverse(a.begin(), a.end())
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define INF 1000000000000000000
#define ordered_set tree<pll, null_type, less<pll>, rb_tree_tag, tree_order_statistics_node_update>
using namespace std;
//using namespace __gnu_pbds;
mt19937 rng(1488);
ll randll(ll l, ll r){
return uniform_int_distribution<ll>(l, r)(rng);
}
vi guess(int n) {
vi a(n);
a[0] = ask(1);
map<ll, ll> mp;
for (int i = 0; (1 << i) < n; i ++) {
vi v;
for (int j = 0; j < n; j ++) {
if (j & (1 << i)) v.pb(j+1);
}
map<ll, ll> m;
vi c = get_pairwise_xor(v);
for (int j : c) {
m[j] --;
}
v.pb(1);
c = get_pairwise_xor(v);
for (int j : c) {
m[j] ++;
}
for (auto j : m) {
if (!j.fr || !j.se) continue;
mp[j.fr ^ a[0]] += (1 << i);
}
}
for(auto i : mp) {
a[i.se] = i.fr;
}
return a;
}
