# haru: pypy
import sys
# input = sys.stdin.readline
II = lambda : int(input())
MI = lambda : map(int, input().split())
LI = lambda : [int(a) for a in input().split()]
SI = lambda : input().rstrip()
LLI = lambda n : [[int(a) for a in input().split()] for _ in range(n)]
LSI = lambda n : [input().rstrip() for _ in range(n)]
MI_1 = lambda : map(lambda x:int(x)-1, input().split())
LI_1 = lambda : [int(a)-1 for a in input().split()]

mod = 998244353
inf = 1001001001001001001
ordalp = lambda s : ord(s)-65 if s.isupper() else ord(s)-97
ordallalp = lambda s : ord(s)-39 if s.isupper() else ord(s)-97
yes = lambda : print("Yes")
no = lambda : print("No")
yn = lambda flag : print("Yes" if flag else "No")

prinf = lambda ans : print(ans if ans < 1000001001001001001 else -1)
alplow = "abcdefghijklmnopqrstuvwxyz"
alpup = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
alpall = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
URDL = {'U':(-1,0), 'R':(0,1), 'D':(1,0), 'L':(0,-1)}
DIR_4 = [[-1,0],[0,1],[1,0],[0,-1]]
DIR_8 = [[-1,0],[-1,1],[0,1],[1,1],[1,0],[1,-1],[0,-1],[-1,-1]]
DIR_BISHOP = [[-1,1],[1,1],[1,-1],[-1,-1]]
prime60 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59]
sys.set_int_max_str_digits(0)
# sys.setrecursionlimit(10**6)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')

from collections import defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
DD = defaultdict
BSL = bisect_left
BSR = bisect_right

# from itertools import permutations

# p = 3
# for q in permutations(range(p * p)):
#     a = [[0] * p for i in range(p)]
#     for i in range(p):
#         for j in range(p):
#             a[i][j] = q[i*p+j]
    
#     ok = 1
#     for i in range(p-1):
#         for j in range(p-1):
#             if a[i][j] + a[i+1][j+1] != a[i][j+1] + a[i+1][j]:
#                 ok = 0
    
#     if ok:
#         for e in a:
#             print(e)
#         print()


p = II()

def ask(i, j):
    print("?", i+1, j+1)
    return II() - 1

x = ask(0, 0)
y = ask(0, 1)

"""
aij = rt * r[i] + ct * c[j]
"""

r = [0] * p
rt = 0
c = [0] * p
ct = 0

if (x - y) % p != 0:
    rt = p
    ct = 1
    r[0] = x // p
    c[0] = x % p
    c[1] = y % p
    for i in range(2, p):
        x = ask(i, i)
        r[i] = x // p
        c[i] = x % p
    
    r[1] = (p * (p - 1) // 2) - sum(r)
    
else:
    rt = 1
    ct = p
    r[0] = x % p
    c[0] = x // p
    c[1] = y // p
    for i in range(2, p):
        x = ask(i, i)
        r[i] = x % p
        c[i] = x // p
    
    r[1] = (p * (p - 1) // 2) - sum(r)

# print(r)
# print(c)

print("!")
for i in range(p):
    a = [0] * p
    for j in range(p):
        a[j] = rt * r[i] + ct * c[j] + 1
    
    print(*a)