#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep3(i, l, n) for (int i = l; i < n; ++i)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define out(a) cout << a << endl
#define SZ(v) (int)v.size()
#define inf (int)(1e9+7)

int main() {
    int n; cin >> n;
    pair<double, pii> a[n];
    rep(i, n) { cin >> a[i].F; a[i].S.F = a[i].F; int b; cin >> b; a[i].S.S = b; a[i].F /= b; }
    sort(a, a + n);
    reverse(a, a + n);
    rep(i, n) out(a[i].S.F << " " << a[i].S.S);
}