#include "bits/stdc++.h"
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const long long mod = 1e9 + 7;

ll gcd(ll a, ll b) {
	return b ? gcd(b, a % b) : a;
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

int main() {
	ll n;
	cin >> n;
	
	vector<tuple<double, double, double>> v(n);

	rep(i, n) {
		double a, b;
		cin >> a >> b;
		v[i]=make_tuple(a/b, a, b);
	}

	sort(rall(v));

	for (auto t : v) {
		ll f = get<1>(t);
		ll s = get<2>(t);
		cout << f << " " << s << endl;
	}
}