#include <bits/stdc++.h>

using i64 = long long;

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int n;
    std::cin >> n;
    
    int m;
    for (int i = 1; ; i++) {
        if ((i * i >= n && (i * i - n) % 3 == 0) || (i * i - 8 >= n && (i * i - 8 - n) % 3 == 0)) {
            m = i;
            break;
        }
    }
    
    std::vector a(m, std::vector<int>(m));
    int tot = m * m;
    int cur = 0;
    
    if ((tot - n) % 3 != 0) {
        cur++;
        for (int i = 0; i < 3; i++) {
            for (int j = 0; j < 3; j++) {
                a[i][j] = cur;
            }
        }
        tot -= 8;
    }
    for (int i = 0; i + 1 < m; i++) {
        for (int j = 0; j + 1 < m; j++) {
            if (a[i][j] == 0 && tot > n) {
                tot -= 3;
                cur++;
                a[i][j] = cur;
                a[i][j + 1] = cur;
                a[i + 1][j] = cur;
                a[i + 1][j + 1] = cur;
            }
        }
    }
    for (int i = 0; i < m; i++) {
        for (int j = 0; j < m; j++) {
            if (a[i][j] == 0) {
                a[i][j] = ++cur;
            }
        }
    }
    
    if (tot != n) {
        std::cout << "Impossible\n";
        return 0;
    }
    std::cout << "Possible\n";
    std::cout << m << "\n";
    for (int i = 0; i < m; i++) {
        for (int j = 0; j < m; j++) {
            std::cout << a[i][j] << " \n"[j == m - 1];
        }
    }
    
    return 0;
}