#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);

    int n;cin>>n;

    vector<pair<long double,pair<int,int>>> v(n);
    rep(i,n){
        int a,b;cin>>a>>b;
        long double c=(long double)((a+0.0)/(b+0.0));
        v[i]=make_pair(c,make_pair(a,b));
    }
    sort(ALL(v));reverse(ALL(v));
    rep(i,n){
        cout<<v[i].second.first<<" "<<v[i].second.second<<endl;
    }
    return 0;
}