#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll=long long;
using ld=long double;
using st=string;
using P=pair<ll,ll>;
typedef atcoder::modint mint;
ll inf=9e18;
template<typename T, int s, int i = 0>
auto vec(const ll (&sizes)[s], const T& init = T()){
  if constexpr(i < s) return vector(sizes[i], vec<T, s, i+1>(sizes, init));
  else return init;
}


int main(){
  ll p,x;
  cin>>p;
  auto v=vec<ll>({p},0);
  auto w=vec<ll>({p},0);
  auto v2=vec<ll>({p},0);
  auto w2=vec<ll>({p},0);
  for(ll i=0;i<p-1;i++){
    printf("? %lld %lld\n",i+1,i+1);
    cin>>x;
    v[i]=(x-1)%p+1;
    w[i]=x/p;
    v2[x%p]=1;
    w2[x/p]=1;
  }
  for(ll i=0;i<p;i++){
    if(v2[i]==0) v[p-1]=(i+p-1)%p+1;
    if(w2[i]==0) w[p-1]=(i+p-1)%p+1;
  }

  printf("? %lld %lld\n",1LL,p);
  cin>>x;
  cout<<"! \n";
  if(x%p==v[0]){
    for(ll i=0;i<p;i++){
      for(ll j=0;j<p;j++){
        cout<<w[j]*p+v[i]<<" ";
      }
      cout<<"\n";
    }
  }else{
    for(ll i=0;i<p;i++){
      for(ll j=0;j<p;j++){
        cout<<w[i]*p+v[j]<<" ";
      }
      cout<<"\n";
    }
  }
}