#include<bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
struct node{int p, q;}s[N];
int gcd(int a, int b){if(b == 0)return a;else return gcd(b, a % b);}
bool cmp(node n1, node n2){return n1.p * n2.q < n2.p * n1.q;} 
int main()
{
    int n;scanf("%d", &n);
    int m = 0;
    for(int i = 1; i <= n; i++)
        for(int j = 0; j <= i; j++)
            if(gcd(i, j) == 1)s[++m] = {j, i};
    sort(s + 1, s + m + 1, cmp);
    for(int i = 1; i <= m; i++)printf("%d/%d\n", s[i].p, s[i].q);
    return 0;
}