#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

using namespace std;

typedef long long ll;

#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define per(i,a,b) for(ll i=b-1LL;i>=(a);--i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
#define ctos(c) string(1,c)
#define print(x) cout<<#x<<" = "<<x<<endl;

#define MOD 1000000007

unsigned int xor128(void) { 
  static unsigned int x = 123456789;
  static unsigned int y = 362436069;
  static unsigned int z = 521288629;
  static unsigned int w = 88675123; 
  unsigned int t;
 
  t = x ^ (x << 11);
  x = y; y = z; z = w;
  return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)); 
}

int main() {
	ll n;
	cin>>n;
	vector<pair<ll,ll> > v;
	rep(i,0,n){
		ll a,b;
		cin>>a>>b;
		v.pb(mp(a,b));
	}
	rep(i,0,10000000){
		ll a = xor128()%n;
		ll b = xor128()%n;
		if(a>b)swap(a,b);
		if(v[a].fi*v[b].se<v[b].fi*v[a].se)swap(v[a],v[b]);
	}
	rep(i,0,n){
		cout << v[i].fi << " " << v[i].se << endl;
	}
	return 0;
}