#include<iostream>
#include<cstdio>
#include<cstdlib>
using namespace std;
int n;
int q[29000][2];
struct hehe
{
	int xu;
	double shu;
}w[29000];
int number=0;
int cmp(const void *a,const void *b);
int main()
{
	freopen ("frac1.in","r",stdin);
	freopen ("frac1.out","w",stdout);
	cin>>n;
	for (int i=1;i<=n;i++)
	{
		for (int j=1;j<=n;j++)
		{
			int a,b;
			a=i;
			b=j;
			while(b^=a^=b^=a%=b);
			if (a>1)
				continue;
			if (i>=j)
				continue;
			q[number][0]=i;
			q[number][1]=j;
			w[number].xu=number;
			w[number].shu=((double)i/j)*10000;
			number++;
		}
	}
	qsort(w,number,sizeof(w[0]),cmp);
	cout<<"0/1"<<endl;
	for (int i=0;i<number;i++)
	{
		cout<<q[w[i].xu][0]<<'/'<<q[w[i].xu][1]<<endl;
	}
	cout<<"1/1";
	return 0;
}
int cmp(const void *a,const void *b)
{
	struct hehe *c=(struct hehe *)a;
	struct hehe *d=(struct hehe *)b;
	return (c->shu > d->shu) ?1:-1;
}