// what is matter? never mind. 
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
#define ull unsigned long long
#define int long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

#define mod 998244353
struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,int b){return a.x==b;}
	friend bool operator !=(modint a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 10005
#define inf 0x3f3f3f3f

int n,m;
int a[1005][1005],cnt;

void check()
{
	bool ok=(m*m>=n && (m*m-n)%3==0);
	ok|=(m*m-8>=n && (m*m-n)%3==2);
	if(!ok)return;
	cnt=0;
	if((m*m-n)%3){
		cnt=1;
		For(i,1,3)For(j,1,3)a[i][j]=1;
	}
//	cerr<<"m: "<<m<<"\n";
	int qwq=(m*m-n)/3;
	if((m*m-n)%3) qwq-=2;
	For(i,1,m-1)
		For(j,1,m-1)
			if(!a[i][j]&&!a[i][j+1]&&!a[i+1][j]&&!a[i+1][j+1]&&qwq)
				a[i][j]=a[i][j+1]=a[i+1][j]=a[i+1][j+1]=++cnt,--qwq;
	For(i,1,m)For(j,1,m)if(!a[i][j])a[i][j]=++cnt;
	if(cnt!=n){
		puts("Impossible");
		exit(0);
	}
	puts("Possible");
	cout<<m<<"\n";
	For(i,1,m)For(j,1,m)cout<<a[i][j]<<" \n"[j==m];
	exit(0);
}
signed main()
{
	n=read();
	for(m=1; ;++m) check();
	return 0;
}
/*

*/