#include<bits/stdc++.h>

using namespace std;

typedef vector<int> VI;
typedef vector<VI> VVI;
#define fin "\n"
inline void init(int n,VVI &c){
    c.resize(n);
    for(auto &v:c){
        v.resize(n);
        for(auto &u:v)u=0;
    }
}

void twotwo(int n,VVI &c){
    init(n,c);
    int q=n/4;
    for(int i=0;i<q;i++){
        for(int j=0;j<q;j++){
            c[i*4][j*4]=(i*4)*n+(j*4)+1;
            c[i*4][j*4+1]=n*n-((i*4)*n+(j*4+1));
            c[i*4][j*4+2]=n*n-((i*4)*n+(j*4+2));
            c[i*4][j*4+3]=(i*4)*n+(j*4+3)+1;
        }
        for(int j=0;j<q;j++){
            c[i*4+1][j*4]=n*n-((i*4+1)*n+(j*4));
            c[i*4+1][j*4+1]=(i*4+1)*n+(j*4+1)+1;
            c[i*4+1][j*4+2]=(i*4+1)*n+(j*4+2)+1;
            c[i*4+1][j*4+3]=n*n-((i*4+1)*n+(j*4+3));
        }
        for(int j=0;j<q;j++){
            c[i*4+2][j*4]=n*n-((i*4+2)*n+(j*4));
            c[i*4+2][j*4+1]=(i*4+2)*n+(j*4+1)+1;
            c[i*4+2][j*4+2]=(i*4+2)*n+(j*4+2)+1;
            c[i*4+2][j*4+3]=n*n-((i*4+2)*n+(j*4+3));
        }
        for(int j=0;j<q;j++){
            c[i*4+3][j*4]=(i*4+3)*n+(j*4)+1;
            c[i*4+3][j*4+1]=n*n-((i*4+3)*n+(j*4+1));
            c[i*4+3][j*4+2]=n*n-((i*4+3)*n+(j*4+2));
            c[i*4+3][j*4+3]=(i*4+3)*n+(j*4+3)+1;
        }
    }
}

void odd(int n,VVI& c){
    init(n,c);
    int x=0,y=n/2;
    c[x][y]=1;
    for(int i=2;i<=n*n;i++){
        int _x=(x+n-1)%n,_y=(y+1)%n;
        if(c[_x][_y])x=(x+1)%n;
        else x=_x,y=_y;
        c[x][y]=i;
    }
}

void lux(int n,VVI &c){
    int magic[][2][2]={{{4,1},{2,3}},{{1,4},{2,3}},{{1,4},{3,2}}};
    init(n,c);
    VVI mark;
    int half=n/2;
    init(half,mark);
    for(int j=0;j<half;j++)mark[half/2+1][j]=1;
    for(int i=(half/2)+2;i<half;i++)for(int j=0;j<half;j++)mark[i][j]=2;
    mark[half/2][half/2]=1;mark[half/2+1][half/2]=0;
    VVI mini;
    odd(n/2,mini);
    for(int i=0;i<half;i++)
        for(int j=0;j<half;j++){
            mini[i][j]--;mini[i][j]*=4;
            for(int x=0;x<2;x++)
                for(int y=0;y<2;y++)
                    c[2*i+x][2*j+y]=mini[i][j]+magic[mark[i][j]][x][y];
        }
}
bool check(VVI res,VI pos,int sr,int sc){
    int n=res.size();
    int gr,gc;
    auto ans=res;
    for(int i=0;i<n;i++)
        for(int j=0;j<n;j++){
            if(res[i][j]==n*n)gr=i,gc=j;
            ans[i][j]=pos[res[i][j]];
        }
    int cnt=0;
    for(int i=0;i<n;i++)
        for(int j=0;j<n;j++)
            for(int r=0;r<n;r++)
                for(int c=0;c<n;c++)
                    if(i*n+j<r*n+c&&ans[i][j]>ans[r][c])cnt++;
    return ((abs(sr-gr)+abs(sc-gc))%2)==(cnt%2);
}
int main(){
    int n;
    VVI res;
    cin>>n;
    if(n==2){
        cout<<"impossible"<<fin;
        return 0;
    }
    else cout<<"possible"<<fin;
    
    VI pos(n*n+1);
    VVI input(n,VI(n));
    int sr,sc,bg=0,ed=n-1;
    for(int i=0;i<n;i++)
        for(int j=0;j<n;j++){
            int &u=input[i][j];
            cin>>u;
            if(u==0){
                u=n*n;
                sr=i;
                sc=j;
            }
            pos[u]=i*n+j;
        }
    switch(n%4){
    case 0:twotwo(n,res);break;
    case 1:odd(n,res);bg++,ed--;break;
    case 2:lux(n,res);break;
    case 3:odd(n,res);break;
    default:
	odd(n,res);break;
    }
    if(check(res,pos,sr,sc)==false){
        for(;bg<ed;bg++,ed--)swap(res[bg],res[ed]);
    }
    for(int i=0;i<n;i++){
        cout<<res[i][0];
        for(int j=1;j<n;j++)cout<<" "<<res[i][j];
        cout<<fin;
    }
    return 0;
}