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

#ifdef CKISEKI
#define safe cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
template <typename ...T>
void debug_(const char *s, T ...a) {
  cerr << "\e[1;32m(" << s << ") = (";
  int cnt = sizeof...(T);
  (..., (cerr << a << (--cnt ? ", " : ")\e[0m\n")));
}
template <typename I>
void orange_(const char *s, I L, I R) {
  cerr << "\e[1;32m[ " << s << " ] = [ ";
  for (int f = 0; L != R; ++L)
    cerr << (f++ ? ", " : "") << *L;
  cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif


int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int n;
  cin >> n;
  if (n == 1) {
    cout << "Possible\n";
    cout << 1 << '\n';
    cout << 1 << '\n';
    return 0;
  }

  vector<tuple<int,int,int>> cur;
  if (n % 3 == 1) {
    cur.emplace_back(0, 0, 1);
    cur.emplace_back(1, 0, 1);
    cur.emplace_back(0, 1, 1);
    cur.emplace_back(1, 1, 1);
  } else if (n % 3 == 0) {
    cur.emplace_back(0, 0, 2);
    cur.emplace_back(0, 2, 1);
    cur.emplace_back(1, 2, 1);
    cur.emplace_back(2, 0, 1);
    cur.emplace_back(2, 1, 1);
    cur.emplace_back(2, 2, 1);
  } else if (n % 3 == 2) {
    cur.emplace_back(0, 0, 3);
    for (int j = 0; j < 3; j++) {
      cur.emplace_back(j, 3, 1);
      cur.emplace_back(3, j, 1);
    }
    cur.emplace_back(3, 3, 1);
  }

  if (cur.size() > n) {
    cout << "Impossible\n";
    return 0;
  }

  while (cur.size() < n) {

    for (auto &[x, y, b]: cur) {
      debug(x, y, b);
      x *= 2;
      y *= 2;
      b *= 2;
      debug(x, y, b);
    }

    debug(cur.size());
    int c = cur.size();
    vector<tuple<int,int,int>> nxt;
    for (auto &[x, y, b]: cur) {
      if (b != 2 || c == n) {
        nxt.emplace_back(x, y, b);
      } else {
        c += 3;
        nxt.emplace_back(x, y, 1);
        nxt.emplace_back(x, y+1, 1);
        nxt.emplace_back(x+1, y+1, 1);
        nxt.emplace_back(x+1, y, 1);
      }
    }

    debug(c);

    cur = nxt;
  }

  cout << "Possible\n";

  int len = 0;
  for (auto [x, y, b]: cur) {
    len = max(len, x + b);
    len = max(len, y + b);
  }

  auto ans = vector(len, vector(len, 0));
  int z = 0;
  for (auto [x, y, b]: cur) {
    ++z;
    for (int i = 0; i < b; i++)
      for (int j = 0; j < b; j++)
        ans[x + i][y + j] = z;
  }
  cout << len << '\n';
  for (int i = 0; i < len; i++)
    for (int j = 0; j < len; j++)
      cout << ans[i][j] << (j+1==len ? '\n' : ' ');
}