#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    int n;
    cin >> n;

    ll a[n], b[n];
    ll mul = 1;
    rep(i,n){
        cin >> a[i] >> b[i];
        mul *= b[i];
    }

    vector<P> v;
    rep(i,n){
        P p;
        p.first = a[i] * mul / b[i];
        p.second = i;
        v.push_back(p);
    }
    sort(v.begin(), v.end(), greater<P>());

    rep(i,n){
        int x = v[i].second;
        cout << a[x] << ' ' << b[x] << endl;
    }
    
    return 0;
}