#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <stdio.h>
#include <cstring>
#include <queue>
#include <stack>
#include <functional>
#include <math.h>
#include <iomanip>
using namespace std;
#define Would
#define you
const int INF = 999999999;
const int MOD = 1e9 + 7;

int main() {
	int n;
	cin >> n;
	vector<pair<double, int>>v(n);
	vector<pair<int, int>>vv(n);
	for (int i = 0; i < n; ++i) {
		cin >> vv[i].first >> vv[i].second;
		v[i] = make_pair((double)vv[i].first / vv[i].second, i);
	}
	sort(v.rbegin(), v.rend());
	for (int i = 0; i < n; ++i) { cout << vv[v[i].second].first << " " << vv[v[i].second].second << endl; }
}