#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <array>
#include <string>
#include <cstdio>
#include <iterator>
#include <unordered_set>
#include <cstdint>
#include <queue>
#include <stack>
#include <deque>
#include <numeric>
#include <fstream>
#include <bitset>
using namespace std;

typedef int32_t ll;

ll ask(ll i, ll j) {
    cout << "? " << i << " " << j << endl;
	cout.flush();
	ll x;
	cin >> x;
    return x;
}


vector<ll> solve(ll size) {
    ll n = size;

    vector<bitset<12>> v(n+1, bitset<12>(0));

    /*
    v[0][1] = 1;
    cerr << v[0] << "\n";
    for(ll i = 0; i < v[0].size(); i++) {
        cout << v[0][i];
    }
    return vector<int>(n, 0);
    */

    vector<ll> out(n+1, 0);

    vector<ll> largestbit(n+1, 0);

    vector<ll> characteristic(11, 0);

    // we can match each index with itself to get its highest bit
    
    ll hg = 0;

    for(ll i = 1; i <= n; i++) {
        //cerr << "\ni=" << i;
        ll curr = ask(i, i);
        //cerr << "\ncurr=" << curr;
        v[i][curr] = 1;
        largestbit[i] = curr;
        hg = max(hg, curr);
        characteristic[curr] = i;
    }
    
    //cerr << "\nhg=" << hg;

    for(ll i = 0; i < hg; i++) {
        //cerr << "\ni=" << i;
        ll base = characteristic[i];
        //cerr << "\ncharacteristic=" << base;
        for(ll j = 1; j <= n; j++) {
            //cerr << "\nj=" << j;
            if(largestbit[j] <= largestbit[base]) {
                //cerr << "\nlargest bit of j is smaller or equal to base's";
                continue;
            }

            ll iscurr = ask(base, j);
            //cerr << "\niscurr(base,j)=" << iscurr;
            if(iscurr == i) {
                v[j][i] = 1;
            }
        }
    }

    vector<ll> twopows(12, 0);
    ll r = 1;
    for(ll i = 0; i < 12; i++) {
        twopows[i] = r;
        r *= 2;
    }

    //cerr << twopows;

    for(ll i = 1; i <= n; i++) {
        for(ll j = 0; j < v[i].size(); j++) {
            out[i] += twopows[j] * v[i][j];
        }
    }

    return out;

}


int main() {
    ll n;
    cin >> n;
    
    vector<ll> v = solve(n);
    cout << "! ";
    for(ll i = 1; i <= n; i++) {
        cout << v[i] << " ";
    }
    cout << endl;
    cout.flush();    
}