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

using ll=long long;
using ldub=long double;
using lldub=__float128;
using str=string;

using mint=modint;

template<class T=ll>
using tup2=tuple<T,T>;
template<class T=ll>
using tup3=tuple<T,T,T>;
template<class T=ll>
using tup4=tuple<T,T,T,T>;
template<class T=ll>
using tup5=tuple<T,T,T,T,T>;
template<class T=ll>
using tup6=tuple<T,T,T,T,T,T>;
template<class T=ll>
using tup7=tuple<T,T,T,T,T,T,T>;

template<class T=ll>
using vec=vector<T>;
template<class T=ll>
using vec2=vector<vec<T>>;
template<class T=ll>
using vec3=vector<vec2<T>>;
template<class T=ll>
using vec4=vector<vec3<T>>;
template<class T=ll>
using vec5=vector<vec4<T>>;
template<class T=ll>
using vec6=vector<vec5<T>>;

template<class T>
using que=queue<T>;
template<class T>
using Pque=priority_queue<T>;
template<class T>
using pque=priority_queue<T, vector<T>, greater<T>>;

struct Edge{
  ll from,to,w=1,num=-1;
};
using gvec=vector<Edge>;
using gvec2=vector<gvec>;

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;}

#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define ins insert
#define tup make_tuple
#define low lower_bound
#define pops(a) __builtin_popcountll(a)
#define ctz(a) __builtin_ctzll(a)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define nperm(v) next_permutation(all(v))
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define YN(f) cout << ((f)?"Yes":"No") << endl

const int IINF=2e9;
const ll INF=4e18;

#ifndef LOCAL
#define debug(x)
#endif




// =================================================




ll ask(ll i,ll j){
  cout << '?' << ' ' << i+1 << ' ' << j+1 << endl;
  ll r;
  cin >> r;
  return r-1;
}

void solve(){
  ll N;
  cin >> N;
  vec2 A(N,vec(N,-1));
  A[0][0]=ask(0,0);
  A[0][1]=ask(0,1);
  for(ll i=1;i<N-1;i++) A[i][i+1]=ask(i,i+1);
  ll f=0;
  if(A[0][0]/N==A[0][1]/N) f=1;
  for(ll i=0;i<N-1;i++){
    for(ll j=0;j<N;j++){
      if(f) A[i][j]=(A[i][i+1]/N*N)+(A[max(0LL,j-1)][j]%N);
      else A[i][j]=(A[i][i+1]%N)+(A[max(0LL,j-1)][j]/N*N);
    }
  }
  if(f){
    set<ll> S;
    for(ll i=0;i<N;i++) S.ins(i);
    for(ll i=0;i<N-1;i++) S.erase(A[i][0]/N);
    ll v=*S.begin();
    for(ll j=0;j<N;j++) A[N-1][j]=v*N+A[0][j]%N;
  }else{
    set<ll> S;
    for(ll i=0;i<N;i++) S.ins(i);
    for(ll i=0;i<N-1;i++) S.erase(A[i][0]%N);
    ll v=*S.begin();
    for(ll j=0;j<N;j++) A[N-1][j]=A[0][j]/N*N+v;
  }
  cout << '!' << endl;
  for(ll i=0;i<N;i++){
    for(ll j=0;j<N;j++) cout << A[i][j]+1 << ' ';
    cout << endl;
  }
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  mint::set_mod(998244353);
  // mint::set_mod(1000000007);

  ll T=1;
  // cin >> T;
  while(T--) solve();
  return 0;
}