#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
struct drob
{
int m, n;
};
bool f(drob dr1, drob dr2)
{
if (dr1.n != dr2.n)
return dr1.m * dr2.n < dr2.m * dr1.n;
return dr1.m < dr2.m;
}
int main()
{
int k, m, n;
cin >> k;
vector<drob> v(k);
for (int i = 0; i < k; i++)
{
cin >> m >> n;
v[i].m = m;
v[i].n = n;
}
sort(v.begin(), v.end(), f);
for (auto e : v)
cout << e.m << '/' << e.n << endl;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8c3RyaW5nPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8YWxnb3JpdGhtPgogCnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiAKc3RydWN0IGRyb2IKewoJaW50IG0sIG47Cn07CiAKYm9vbCBmKGRyb2IgZHIxLCBkcm9iIGRyMikKewoJaWYgKGRyMS5uICE9IGRyMi5uKQoJCXJldHVybiBkcjEubSAqIGRyMi5uIDwgZHIyLm0gKiBkcjEubjsKCXJldHVybiBkcjEubSA8IGRyMi5tOwp9CiAKaW50IG1haW4oKQp7CglpbnQgaywgbSwgbjsKCWNpbiA+PiBrOwoJdmVjdG9yPGRyb2I+IHYoayk7Cglmb3IgKGludCBpID0gMDsgaSA8IGs7IGkrKykKCXsKCQljaW4gPj4gbSA+PiBuOwoJCXZbaV0ubSA9IG07CgkJdltpXS5uID0gbjsKCX0KCXNvcnQodi5iZWdpbigpLCB2LmVuZCgpLCBmKTsKCSAgZm9yIChhdXRvIGUgOiB2KQoJCWNvdXQgPDwgZS5tIDw8ICcvJyA8PCBlLm4gPDwgZW5kbDsKfQ==