#include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define RREP(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
//const ll INF = 1LL << 60;
//const int INF = 1001001001;


int main(void){
	int n;
	cin >> n;
	vector< tuple<double ,int, int> > v(n);
	REP(i,n){
		int a,b;
		cin >> a >> b;
		double x=(double)a/b;
		v[i]={x,a,b};
	}
	sort(RALL(v));
	REP(i,n){
		cout << get<1>(v[i]) << " " << get<2>(v[i]) << endl;
	}
    return 0;
}