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

typedef long long ll;
typedef pair<int, int> pii;

const int maxm = 1e5 + 100;
const int maxn = 1e5 + 100;
const int maxc = 100;

#define SZ(x) int((x).size())
#define rep(i, a, b) for(int i = a; i < (b); i++)
#define pb push_back

ll euclid(ll a, ll b, ll &x, ll &y){
    if (!b) return x = 1, y = 0, a;
    ll d = euclid(b, a % b, y, x);
    return y -= a/b * x, d;
}
ll crt(ll a, ll m, ll b, ll n){
    if(n > m) swap(a, b), swap(m, n);
    ll x, y, g = euclid(m, n, x, y);
    assert((a - b) % g == 0); // else no solution
    x = (b - a) % n * x % n / g * m + a;
    return x < 0 ? x + m*n/g : x;
}

int n;
int cnt;
bool vx[maxn], vy[maxn];
vector<pii> vec;
bool kir;

int DX = 1, DY = 1;

void solve(int x, int y, int c){
    if(!(0 <= x && x < n && 0 <= y && y < n)) return;
    if(vx[x] || vy[y]) return;
    vec.pb({x, y});
    vx[x] = 1;
    vy[y] = 1;
    if(c == n - 1){
        if(kir) cout << "POSSIBLE\n";
        for(auto [x, y] : vec){
            cout << x + DX << " " << y + DY << "\n";
        }
        exit(0);
    }
    for(int i = -1; i < 2; i += 2){
        for(int j = -1; j < 2; j += 2){
            solve(x + i, y + j * 3, c + 1);
            solve(x + 3 * i, y + j, c + 1);
        }
    }
    vec.pop_back();
    vx[x] = 0;
    vy[y] = 0;
}

pii pat[9] = {{0, 2}, {3, 1}, {6, 0}, {5, 3}, {2, 4}, {1, 7}, {4, 6}, {7, 5}, {8, 8}};

int main(){

    cin >> n;

    if(n < 20){
        kir = 1;
        for(int i = 0; i < n; i++){
            for(int j = 0; j < n; j++){
                solve(i, j, 0);
            }
        }
        cout << "IMPOSSIBLE\n";
        return 0;
    }

    cout << "POSSIBLE\n";
    while(n > 20){
        rep(i, 0, 9){
            cout << pat[i].first + DX << " " << pat[i].second + DY << "\n";
        }
        DX += 9;
        DY += 9;
        n -= 9;
    }

    solve(0, 2, 0);

    return 0;
}

/*
0 2
3 1
6 0
5 3
2 4
1 7
4 6
7 5
8 8
*/