#include<iostream>
#include<algorithm>
#include <vector>
#include<cmath>
using namespace std;
int main() {
	int n;
	cin >> n;
	vector<float>veca(2 * n);
	for (int ia = 0; ia < 2 * n; ia++) {
		cin >> veca.at(ia);
	}
	vector<float>vecb(n);
	for (int ib = 0; ib < n; ib++) {
		vecb.at(ib) = veca.at(2 * ib) / veca.at(2 * ib + 1);
	}
	sort(vecb.begin(), vecb.end());
	reverse(vecb.begin(), vecb.end());
	for (int id = 0; id < n; id++) {
		for (int ic = 0; ic < n; ic++) {
			if (veca.at(2 * ic) / veca.at(2 * ic + 1) == vecb.at(id)) {
				cout << veca.at(2 * ic) << " "<< veca.at(2 * ic + 1) << endl;
			}
			else continue;
		}

	}
}