/* -*- coding: utf-8 -*-
 *
 * 750.cc:  No.750 Frac #1 - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 10;

/* typedef */

typedef pair<int,int> pii;

/* global variables */

pii ps[MAX_N];

/* subroutines */

bool ltpii(const pii &a, const pii &b) {
  return a.first * b.second < b.first * a.second;
}

/* main */

int main() {
  int n;
  scanf("%d", &n);

  for (int i = 0; i < n; i++) scanf("%d%d", &ps[i].first, &ps[i].second);
  sort(ps, ps + n, ltpii);

  for (int i = n - 1; i >= 0; i--)
    printf("%d %d\n", ps[i].first, ps[i].second);
  return 0;
}