//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
vector<int> solve(int n)
{
	if(n==4) return {6,3,0,7};
	if(n==5) return {8,3,6,0,9};
	if(n==6) return {10,7,2,6,0,11};
	if(n==7) return {8,5,12,3,9,0,13};
	vector<int> ret=solve(n-4);
	for(auto &x:ret) x+=4;
	ret.insert(ret.begin(),3);
	ret.insert(ret.begin(),n*2-2);
	ret.pb(0);
	ret.pb(n*2-1);
	return ret;
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin>>n;
	if(n==3)
	{
		cout<<"2 to -1"<<endl;
		cout<<"5 to 2"<<endl;
		cout<<"3 to -3"<<endl;
		return 0;
	}
	vector<int> vec=solve(n);
	vec.insert(vec.begin(),-1);
	for(int i=1;i<sz(vec);i++)
		cout<<vec[i]<<" to "<<vec[i-1]<<endl;
	return 0;
}