#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int INF = (int)1e9 + 1001010;
constexpr ll llINF = (ll)4e18 + 22000020;
const string endn = "\n";
template <class T> inline auto vector2(size_t i, size_t j, const T &init = T()) {return vector(i, vector<T>(j, init));}
template<class T> vector<T>& operator ++(vector<T> &A, int n) {for(auto &I : A) {I++;} return A;}
template<class T> vector<T>& operator --(vector<T> &A, int n) {for(auto &I : A) {I--;} return A;}
template<class T, class U> bool chmax(T &a, const U &b) {return ((a < b) ? (a = b, true) : false);}
template<class T, class U> bool chmin(T &a, const U &b) {return ((a > b) ? (a = b, true) : false);}
ll floor(ll a, ll b){if(b < 0) a = -a, b = -b; return a >= 0 ? a/b : (a+1)/b - 1;}
ll ceil (ll a, ll b){if(b < 0) a = -a, b = -b; return a > 0 ? (a-1)/b + 1 : a/b;}
ll bit(unsigned long long val, unsigned long long digit){return (val >> digit) & 1;}
// ================================== ここまでテンプレ ==================================


const string ELEM_SEPARATION = endn, VEC_SEPARATION = endn;
const string PT_SEPARATION = " ";
template<class T> istream& operator >>(istream &i, vector<T> &A);
template<class T> ostream& operator <<(ostream &o, const vector<T> &A);
template<class T> ostream& operator <<(ostream &o, const vector<vector<T>> &A);
template<class T> ostream& operator <<(ostream &o, const deque<T> &A);
template<class T, class U> istream& operator >>(istream &i, pair<T,U> &A);
template<class T, class U> ostream& operator <<(ostream &o, const pair<T,U> &A);
template<class T, class U, class V> istream& operator >>(istream &i, tuple<T,U,V>&A);
template<class T, class U, class V> ostream& operator <<(ostream &o, const tuple<T,U,V> &A);

template<class T> istream& operator >>(istream &i, vector<T> &A) {for(auto &I : A) {i >> I;} return i;}
template<class T> ostream& operator <<(ostream &o, const vector<T> &A) {int i=A.size(); for(auto &I : A){o << I << (--i ? ELEM_SEPARATION : "");} return o;}
template<class T> ostream& operator <<(ostream &o, const vector<vector<T>> &A) {int i=A.size(); for(auto &I : A){o << I << (--i ? VEC_SEPARATION : "");} return o;}
template<class T> ostream& operator <<(ostream &o, const deque<T> &A) {int i=A.size(); for(auto &I : A){o << I << (--i ? ELEM_SEPARATION : "");} return o;}
template<class T, class U> istream& operator >>(istream &i, pair<T,U> &A) {i >> A.first >> A.second; return i;}
template<class T, class U> ostream& operator <<(ostream &o, const pair<T,U> &A) {o << A.first << PT_SEPARATION << A.second; return o;}
template<class T, class U, class V> istream& operator >>(istream &i, tuple<T,U,V>&A) {i >> get<0>(A) >> get<1>(A) >> get<2>(A); return i;}
template<class T, class U, class V> ostream& operator <<(ostream &o, const tuple<T,U,V> &A) {o << get<0>(A) << PT_SEPARATION << get<1>(A) << PT_SEPARATION << get<2>(A); return o;}


int main(int argc, char *argv[]){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n; cin >> n;
    vector<pair<int, int>> v(n); cin >> v;
    sort(v.begin(), v.end(),
        [&](auto p, auto q) -> bool {
            return p.first * q.second > p.second * q.first;
        }
    );

    cout << v << endn;
    return 0;
}