#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<int(n); i++)
#define FOR(i,m,n) for(int i=int(m); i<int(n); i++)
#define ALL(obj) (obj).begin(),(obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL vector<vector<long long>>
#define VC vector<char>
#define VS vector<string>
#define VVC vector<vector<char>>
#define fore(i,a) for(auto &i:a)
typedef long long ll;
typedef pair <int, int> P;
template<class T> bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }
const int  INF = 2147483647;
const ll INFL = 9223372036854775807;
const ll mod = 1000000007;



int main() {
	int n;
	cin >> n;
	VI a(n), b(n);
	REP(i, n)cin >> a[i] >> b[i];

	vector<pair<double, double>> v(n);
	REP(i, n) {
		v[i].first = double(a[i]) / double(b[i]);
		v[i].second = i;
	}
	sort(ALL(v));
	reverse(ALL(v));
	vector<P> ans;
	REP(i, n) {
		cout << a[v[i].second] << ' ' << b[v[i].second] << endl;
	}
	

	return 0;
}