// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx")
// #pragma comment(linker, "/stack:200000000"]

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <bitset>
#include <stack>
#include <random>
#include <fstream>
#include <sstream>
#include <chrono>

#define fi first
#define se second
#define pb push_back
#define ll long long
#define ld long double
#define hm unordered_map
#define pii pair<int, int>
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define cinv(v) for (auto& x: v) cin >> x
#define fr(i, n) for (int i = 0; i < n; ++i)
#define fl(i, l, n) for (int i = l; i < n; ++i)

// #define int ll

template <typename T1, typename T2> inline bool chkmin(T1 &x, const T2 &y) {if (x > y) {x = y; return 1;} return 0;}
template <typename T1, typename T2> inline bool chkmax(T1 &x, const T2 &y) {if (x < y) {x = y; return 1;} return 0;}

using namespace std;

#ifdef LOCAL
	#define dbg(x) cerr << #x << " : " << x << '\n'
	const int maxn = 20;
#else
	#define dbg(x)
	const int maxn = 2e5 + 20;
#endif

//tg: @galebickosikasa

ostream& operator << (ostream& out, vector<int>& v) {
	for (auto& x: v) out << x << ' ';
	return out;
}

ostream& operator << (ostream& out, pii& v) {
	out << v.fi << ", " << v.se;
	return out;
}

istream& operator >> (istream& in, pii& a) {
	in >> a.fi >> a.se;
	return in;
}

const ll inf = (ll) 2e9;
const ld pi = asin (1) * 2;
const ld eps = 1e-8;
const ll mod = (ll)1e9 + 7;
const ll ns = 97;

mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());


int askxor (int i, int j) {
	cout << "XOR " <<  i + 1 << ' ' << j + 1 << endl;
	int x;
	cin >> x;
	return x;
}

int askor (int i, int j) {
	cout << "OR " <<  i + 1 << ' ' << j + 1 << endl;
	int x;
	cin >> x;
	return x;
}

int askand (int i, int j) {
	cout << "AND " <<  i + 1 << ' ' << j + 1 << endl;
	int x;
	cin >> x;
	return x;
}

void solve () {
	int n;
	cin >> n;
	vector<int> goo (n);
	map <int, int> kek;
	int a = -1, b = -1;
	fl (i, 1, n) {
		int x = askxor (0, i);
		if (kek.count (x)) {
			a = kek[x], b = i;
		}
		kek[x] = i;
		goo[i] = x;
		if (x == 0) {
			a = 0, b = i;
		}
	}
	vector<int> ans (n);
	if (a != -1) {
		int x = askor (a, b);
		goo[0] = goo[a] ^ x;
		fl (i, 1, n) ans[i] = goo[0] ^ goo[i];
	} else {
		int j = -1;
		fl (i, 1, n) if (goo[i] == 1) j = i;
		int x = askand (0, j);
		goo[0] = x;
		fl (i, 1, n) {
			if (i == j || goo[i] & 1) continue;
			int y = askor (0, i);
			if (y & 1) ++goo[0];
		}
		fl (i, 1, n) ans[i] = goo[0] ^ goo[i];
	}
	cout << "! " << ans << endl;




}

signed main () {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int q = 1;
	// cin >> q;
	while (q--) solve ();






}