//#include <bits/stdc++.h>
#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <functional>
#include <map>
#include <iomanip>
#include <math.h> 
#include <stack>
#include <queue>
#include <bitset>
#include <cstdlib>
#include <tuple>
#include <cctype>
#include <ctype.h>
#include <set>
#include <sstream>
using namespace std;
#define int long long
#define rep(i,s,n) for(int i = s;i<n;i++)
#define repe(i,s,n) for(int i = s;i<=n;i++)
#define rrep(i,s,n) for(int i = (n)-1;i>=(s);i--)
#define all(v) (v).begin(),(v).end()
#define pb push_back
#define fi first
#define se second
#define chmin(a,b) a=min((a),(b))
#define chmax(a,b) a=max((a),(b))
typedef long long ll;
typedef pair<int, int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
typedef pair<pint, int> P1;
typedef pair<int, pint> P2;
typedef pair<pint, pint> PP;
static const ll maxLL = (ll)1 << 62;
const ll MOD = 1000000007;
const ll INF = 1e18;

int N, M;
vpint v[200020];

signed main() {
	int i, j;
	int n;
	vector < pair<double, int>>list;
	//vector<P2> list2;
	map<int, pint>list2;

	cin >> n;

	rep(i, 0, n) {
		double num1, num2;
		cin >> num1 >> num2;
		list.push_back(make_pair(num1 / num2, i));
		list2.insert(make_pair(i, make_pair(num1, num2)));
	}

	sort(all(list));

	rrep(i, 0, n) {
		cout << list2[list[i].second].first << " " << list2[list[i].second].second << endl;
	}


	getchar();
	getchar();
	return 0;
}