#include <bits/stdc++.h>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define repeat(i,s,n) for(int (i)=s; (i)<(n); (i)++)
#define revrep(i,n) for(int (i)=(n)-1;i>=0; i--)

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout<<setprecision(std::numeric_limits<float>::max_digits10);
  int n;
  cin>>n;
  vector<pair<int,int>> ab(n);
  rep(i,n) {
    int a,b;
    cin>>a>>b;
    ab[i]=make_pair(a,b);
  }
  rep(i,n) {
    for(int j=n-1; j>=i+1; j--) {//a1/b1<a2/b2 <=> a1*b2<a2*b1
      if(ab[j-1].first*ab[j].second<ab[j].first*ab[j-1].second) {
        auto t = ab[j-1];
        ab[j-1]=ab[j];
        ab[j]=t;
      }
    }
  }
  rep(i,n) {
    cout << ab[i].first << " " << ab[i].second << endl;
  }
  return 0;
}