#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll a[100005], b[100005], i = 1, n, bc = 1, uc;
ll bcln(ll a, ll b)
{
    return a * b / __gcd(a, b);
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);//n
    cout.tie(0);
    cin >> n;
    for (i = 1; i <= n; i++)
    {
        cin >> a[i] >> b[i];
        bc = bcln(bc, b[i]);
    }
    for (i = 1; i <= n; i++)
    {
        a[i] = a[i] * bc / b[i];
        b[i] = b[i] * bc / b[i];
    }
    sort(a + 1, a + n + 1);
    for (i = 1; i <= n; i++)
    {
        uc = __gcd(a[i], b[i]);
        a[i] /= uc;
        b[i] /= uc;
        cout << a[i] << " " << b[i] << endl;
    }
    return 0;
}

#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>

using namespace std;

bool condition(pair<long, long> i, pair<long, long> j)
{
    return (i.first*1.0/i.second < j.first*1.0/j.second);
}

int main()
{
    long n;
    cin >> n;
    vector<pair<long, long>> a(n, pair<long, long>());
    for (long i=0; i<n; i++)
    {
        long p, q, gcd;
        cin >> p >> q;
        gcd = __gcd(p,q);
        p /= gcd;
        q /= gcd;
        a[i] = make_pair(p,q);
    }
    sort(a.begin(), a.end(), condition);
    for (pair<long, long> i:a) cout << i.first << " " << i.second << endl;
}

$\\$

`@Daoanhviet96`