#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;


ll gcd(ll a, ll b){
  if(b<a) swap(a, b);
  ll r = a % b;
  if(r==0) return b;
  while(r!=0) r = a % b, a = b, b = r;
  return a;
}

struct fraction{
  ll a, b;
  fraction(){};
  fraction(ll A, ll B){// A/B
    if(A==0) B = 1;
    else{
      if(B<0) A*=-1, B*=-1;
      ll g = gcd(abs(A), abs(B));
      A/=g, B/=g;
    }
    a = A, b = B;
  }
  bool operator == (fraction r) const{
    return (this->a==r.a && this->b==r.b);
  }

  bool operator < (fraction r) const {
    __int128_t left = (__int128_t)this->a*(__int128_t)r.b;
    __int128_t right = (__int128_t)r.a*(__int128_t)this->b;
    return left < right;
  }

  bool operator <= (fraction r) const{
    __int128_t left = (__int128_t)this->a*(__int128_t)r.b;
    __int128_t right = (__int128_t)r.a*(__int128_t)this->b;
    std::cout << (ll)left << " " << (ll)right << '\n';
    return left <= right;
  }
  bool operator > (fraction r) const{
    __int128_t left = (__int128_t)this->a*(__int128_t)r.b;
    __int128_t right = (__int128_t)r.a*(__int128_t)this->b;
    return left > right;
  }
  bool operator >= (fraction r) const{
    __int128_t left = (__int128_t)this->a*(__int128_t)r.b;
    __int128_t right = (__int128_t)r.a*(__int128_t)this->b;
    return left >= right;
  }

};
void print(fraction f){
  printf("(%lld / %lld)", f.a, f.b);
}
void println(fraction f){
  printf("(%lld / %lld)\n", f.a, f.b);
}
int main(int argc, char const *argv[]) {
  ll n;std::cin >> n;
  vector<fraction> v(n);
  for(int i=0;i<n;i++) {
    ll a, b;std::cin >> a >> b;
    v[i] = fraction(a, b);
  }
  sort(all(v));
  reverse(all(v));
  for(int i=0;i<n;i++){
    std::cout << v[i].a << " " << v[i].b << '\n';
  }

}