#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
using namespace std;
long long mod = 1e9 + 7;

bool comp(pair<int, int> l, pair<int,int> r) {
  return (l.first * r.second) > (l.second * r.first);
}

int main(void) {
  int n; cin >> n;
  vector<pair<int,int>> p(n);
  for(int i=0; i<n; i++) cin >> p[i].first >> p[i].second;

  sort(p.begin(), p.end(), comp);
  for(int i=0; i<n; i++) {
    cout << p[i].first << " " << p[i].second << endl;
  }

  return 0;
}



// EOF