#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pl;
typedef pair<ll,pl> ppl;
typedef pair<ll,ppl> pppl;
typedef pair<ll,pppl> pppppl;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) begin(a),end(a)
#define sz(a) (int)(a).size()
// #define F first
// #define S second
#define bs(A,x) binary_search(all(A),x)
#define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin())
#define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin())
#define cou(A,x) (ll)(upper_bound(all(A),x)-lower_bound(all(A),x))
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
//*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint a){os<<a.val();return os;}
istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;}
//*/
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>v){rep(i,0,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}

void Solve() {
    int P;
    cin >> P;
    vector<vector<int>> ANS(P, vector<int>(P, -1));
    rep(i,0,P-1) {
        cout << "? " << i+1 << ' ' << i+1 << endl;
        cin >> ANS[i][i];
        ANS[i][i]--;
    }
    {
        cout << "? " << 1 << ' ' << 2 << endl;
        cin >> ANS[0][1];
        ANS[0][1]--;
    }
    vector<int> X(P), Y(P);
    if (ANS[0][1] % P == ANS[0][0] % P) {
        int XOR = 0, YOR = 0;
        rep(i,0,P) XOR ^= i, YOR ^= i;
        rep(i,0,P-1) {
            X[i] = ANS[i][i] % P;
            XOR ^= X[i];
            Y[i] = (ANS[i][i] / P) * P;
            YOR ^= (Y[i]/P);
        }
        X[P-1] = XOR;
        Y[P-1] = YOR * P;
    }
    else {
        int XOR = 0, YOR = 0;
        rep(i,0,P) XOR ^= i, YOR ^= i;
        rep(i,0,P-1) {
            X[i] = (ANS[i][i] / P) * P;
            XOR ^= (X[i]/P);
            Y[i] = ANS[i][i] % P;
            YOR ^= Y[i];
        }
        X[P-1] = XOR * P;
        Y[P-1] = YOR;
    }
    cout << "! " << endl;
    rep(i,0,P) {
        rep(j,0,P) {
            cout << X[i]+Y[j]+1;
            if (j+1==P) cout << endl;
            else cout << ' ';
        }
    }
}

int main(){
    //cin.tie(0)->sync_with_stdio(0);
    //cin.exceptions(cin.failbit);
    ll _ = 1;
    //cin>>_;
    while(_--){
        Solve();
    }
    return 0;
}