// what is matter? never mind.
#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 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 2000005
#define inf 0x3f3f3f3f

int n,bo;
pii res[maxn];
int m;

void wk(int x,int y){
	++m;
	res[m]=mkp(res[m-1].fi+x,res[m-1].se+y);
}

int pre[maxn];
bool f[maxn];

namespace B{


int p[maxn],q[maxn];

int e[233][233];
bool chk(int dx,int dy){
	dx=abs(dx),dy=abs(dy);
	return (dx==3&&dy==1)||(dx==1&&dy==3);
}

void main()
{
	For(i,1,n)p[i]=i;
	int tim=0;
	do{
		++tim;
	//	if(tim%100==0)cout<<tim<<"\n";
		For(i,1,n)q[i]=i;
		For(i,1,n)For(j,1,n)e[i][j]=chk(i-j,p[i]-p[j]);
		do{
			bool ok=1;
			For(i,1,n-1) if(!e[q[i]][q[i+1]]){
				ok=0;
				break;
			}
			if(ok){
				For(i,1,n) cout<<q[i]<<" "<<p[q[i]]<<"\n";
				exit(0);
			}
		}while(next_permutation(q+1,q+n+1)); 
	}while(next_permutation(p+1,p+n+1));
}	

}

signed main()
{
	n=read();
	if(n>=2 && n<=4){
		puts("IMPOSSIBLE");
		exit(0);
	}
	puts("POSSIBLE");
	if(n==1){
		puts("1 1");
		exit(0);
	}
	f[1]=1;
	for(int x:{6,8,9}){
		For(i,x+1,100000){
			if(f[i-x] && !f[i])
				f[i]=1,pre[i]=x;
		}
	}
	if(n<=6) B::main();
	res[m=1]=mkp(1,1);
	int add=0;
	if(!f[n]){
		if(f[n+1])++n,++add;
		else if(f[n+2])n+=2,add+=2;
		else assert(0);
	}
	while(n!=1){
		int x=pre[n];
		n-=x;
		if(x==6){
			wk(1,3),wk(3,1),wk(1,-3);
			wk(-3,1),wk(1,3),wk(3,1);
		}
		if(x==8){
			wk(1,3),wk(1,3),wk(3,1);
			wk(-1,-3),wk(-1,-3),wk(3,1);
			wk(1,3),wk(1,3);
		}
		if(x==9){
			wk(1,3);
			wk(3,-1);
			wk(3,-1);
			wk(-1,3);
			wk(-3,1);
			wk(-1,3);
			wk(3,-1);
			wk(3,-1);
			wk(1,3);
		}
	}
	if(add==1)--m,--add;
	if(add==2){
		For(i,2,m-1)cout<<res[i].fi-1<<" "<<res[i].se-1<<"\n";
	}else{
		For(i,1,m) cout<<res[i].fi<<" "<<res[i].se<<"\n";
	}
	return 0;
}

/*
1 1
2 4
5 3
8 2
7 5
4 6
3 9
6 8
9 7
10 10
*/