#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

ll mod_pow(ll x, ll n, ll m) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 2;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
vector<vector<int>> ad[3] = { {{4,1},{2,3}},{{1,4},{2,3}},{{1,4},{3,2}} };
vector<vector<int>> make_s(int n) {
	if (n % 2) {
		vector<vector<int>> res(n, vector<int>(n));
		vector<vector<bool>> used(n, vector<bool>(n, false));
		int x = 0, y = n / 2;
		rep1(i, n * n) {
			res[x][y] = i; used[x][y] = true;
			if (i < n * n) {
				int nx = x - 1, ny = y + 1;
				if (nx < 0)nx += n;
				if (ny == n)ny = 0;
				if (used[nx][ny]) {
					nx = x + 1, ny = y;
					if (nx == n)nx = 0;
				}
				x = nx, y = ny;
			}
		}
		return res;
	}
	if (n % 4 == 0) {
		vector<vector<int>> res(n, vector<int>(n));
		if (n == 4) {
			res = { {16,9,7,2},{3,6,12,13},{10,15,1,8},{5,4,14,11} };
			return res;
		}
		vector<vector<int>> col(n, vector<int>(n, 0));

		rep(i, n / 4)rep(j, n / 4) {
			rep(k, 4) {
				col[i * 4 + k][j * 4 + k] = 1;
				col[i * 4 + k][j * 4 + 3 - k] = 1;
			}
		}
		rep(i, n)rep(j, n) {
			if (col[i][j]) {
				res[i][j] = i * n + j + 1;
			}
		}
		per(i, n)per(j, n) {
			if (!col[i][j]) {
				res[i][j] = (n - 1 - i) * n + (n - 1 - j) + 1;
			}
		}
		return res;
	}
	int d = n / 2;
	vector<vector<int>> res(n, vector<int>(n));
	vector<vector<int>> p = make_s(d);
	rep(i, d)rep(j, d) {
		p[i][j] = (p[i][j] - 1) * 4;
	}
	rep(i, d)rep(j, d) {
		int lx = 2 * i, ly = 2 * j;
		int col = 0;
		if (i > d / 2 + 1)col = 2;
		else if (i < d / 2 + 1) {
			col = 0;
			if (i == d / 2 && j == d / 2)col = 1;
		}
		else {
			col = 1;
			if (j == d / 2)col = 0;
		}
		rep(s, 2)rep(t, 2) {
			res[lx + s][ly + t] = p[i][j] + ad[col][s][t];
		}
	}
	return res;
}
int n;
vector<vector<int>> a;
int calc(vector<vector<int>> v) {
	int res = 0;
	rep(i, n * n) {
		int cx, cy;
		rep(j, n)rep(k, n)if (v[j][k] == i + 1) {
			cx = j, cy = k;
		}
		int x = i / n, y = i % n;
		while (x != cx || y != cy) {
			res ^= 1;
			if (x < cx) {
				swap(v[cx - 1][cy], v[cx][cy]);
				cx--;
			}
			else if (x > cx) {
				swap(v[cx + 1][cy], v[cx][cy]);
				cx++;
			}
			else if (y < cy) {
				swap(v[cx][cy - 1], v[cx][cy]);
				cy--;
			}
			else{
				swap(v[cx][cy + 1], v[cx][cy]);
				cy++;
			}
		}
	}
	return res;
}

void trev(vector<vector<int>> &a) {
	rep(i, n / 2) {
		rep(j, n) {
			swap(a[i][j], a[n - 1 - i][j]);
		}
	}
}
void yrev(vector<vector<int>>& a) {
	rep(i, n)rep(j, n / 2) {
		swap(a[i][j], a[i][n - 1 - j]);
	}
}
void solve() {
	/*for (n = 3; n <= 50; n++) {
		vector<vector<int>> ans = make_s(n);
		cout << n << " " << calc(ans) << "\n";
	}*/
	cin >> n;
	a.resize(n, vector<int>(n));
	rep(i, n)rep(j, n)cin >> a[i][j];
	rep(i, n)rep(j, n)if (a[i][j] == 0)a[i][j] = n * n;
	int b = calc(a);
	if (n == 1) {
		cout << "possible\n";
		cout << 1 << "\n"; return;
	}
	else if (n == 2) {
		cout << "impossible\n";
	}
	else {
		vector<vector<int>> ans = make_s(n);
		rep(i, 2)rep(j, 2) {
			vector<vector<int>> cop = ans;
			if (i)trev(cop);
			if (j)yrev(cop);
			int c = calc(cop);
			if (b == c) {
				cout << "possible\n";
				rep(i, n) {
					rep(j, n) {
						if (j > 0)cout << " ";
						cout << cop[i][j];
					}
					cout << "\n";
				}
				return;
			}
		}
		assert(false);
	}
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//expr();
	//int t; cin >> t; rep(i, t)
	//while (cin >> n >> m>>s1>>s2>>t, n)
	solve();
	return 0;
}