#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using i64 = long long;
const int MAX_N = 2000;

int res[MAX_N][MAX_N];

pair<int,int> get_ab(int v) {
	return {v/2, v/2-1};
}
void cons(int x, int y) {
}
int main() {
	cin.tie(nullptr)->sync_with_stdio(false);
	int n;
	cin >> n;
	if (set<int>{2, 3, 5}.count(n))
		return cout << "Impossible\n", 0;
	cout << "Possible\n";
	if (n == 1) {
		cout << "1\n1\n";
		return 0;
	}

	bool cp = false;
	if (n % 2) {
		n -= 3;
		cp = true;
	}

	auto [a, b] = get_ab(n);
	assert(a * a - b * b == (n-1));

	int uv = 1;
	for (int i = 0;i < b;++i)
		for (int j = 0;j < b;++j)
			res[i][j] = uv;
	++uv;

	for (int i = 0;i < a;++i) for (int j =0 ;j < a;++j)
		if (res[i][j] == 0) res[i][j] = uv++;

	if (cp) {
		for (int i = 0;i < a;++i)
			for (int j = 0;j < a;++j)
				res[i][j+a] = uv;
		++uv;
		for (int i = 0;i < a;++i)
			for (int j = 0;j < a;++j)
				res[i+a][j] = uv;
		++uv;
		for (int i = 0;i < a;++i)
			for (int j = 0;j < a;++j)
				res[i+a][j+a] = uv;
		++uv;
		a *= 2;
	}

	cout << a << '\n';
	for (int i = 0;i < a;++i) for (int j = 0;j < a;++j)
		cout << res[i][j] << " \n"[j+1==a];

}