#include <iostream>
using namespace std;
class linklist {
private:
class linknode {
public:
int n, m;
linknode *next;
linknode():next(NULL) {}
linknode(int x, int y):n(x),m(y),next(NULL) {}
};
linknode *head, *tail;
public:
linklist() {
head=new linknode(0,1);
tail=new linknode(1,1);
head->next=tail;
}
void solve(int a) {
for(int i=2;i<=a;i++) {
linknode *p=head;
while(p!=tail) {
if(p->m+p->next->m<=i) {
linknode *temp=new linknode(p->n+p->next->n,p->m+p->next->m);
temp->next=p->next;
p->next=temp;
p=temp->next;
}
else p=p->next;
}
}
}
void display() {
linknode *p=head;
int num=0;
while(p) {
cout<<p->n<<"/"<<p->m;
num++;
if(num%10==0) cout<<endl;
else cout<<"\t";
p=p->next;
}
cout<<endl;
}
};
int main() {
int a;
cin>>a;
linklist l;
l.solve(a);
l.display();
return 0;
}