#include<iostream>
#include <algorithm>
#include<string>
#include <bitset>
#include <vector>
#include <functional>
#include <climits>
#include <iomanip>
#include <utility>
#include <stack>
#include <queue>
#include <math.h>
#include <iomanip>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <numeric>
using namespace std;
using ll = long long;

typedef pair <int, int> pii;

int main()
{

	int a = 0, b = 0, c = 0, d = 0, e = 0, f = 0, g = 0, h = 0, ans = 0;
	//cout << LONG_MAX << endl;
	//long long n, A[1000000000];
	//ll n, m, q;
	cin >> a;
	int x[100] = {};
	int y[100] = {};
	for (int i = 0; i < a; i++)
	{
		cin >> x[i];
		cin >> y[i];
	}
	while (accumulate(x, x + a, 0) != a*(-9999999))
	{

		for (int i = 0; i < a; i++)
		{
			b = 0;
			for (int k = 0; k < a; k++)
			{
				if ( x[k] == -9999999 ||i==k)
				{
					continue;
				}
				if (double(x[i]) / double(y[i]) < double(x[k]) / double(y[k]) )
				{
					b = 1;
					break;
				}
			}
			if (b == 0)
			{

				cout << x[i] << " " << y[i] << endl;
				x[i] = -9999999;
				y[i] = 1;
				c++;
				if (c==a)
				{
					return 0;
				}

			}
		}

	}
	////std::cout << std::fixed;
	//cout << std::setprecision(20) << << endl;
	//cout << d+1 << endl;
	//cout << "" << endl;

	return 0;
}

//memcpy(x, visited, sizeof(ll)*n);
//void kansuu(ll num, ll visited[10]) {}
//kansuu(1, zz);
//cout << setprecision(15) << v << endl;

//int temp;
//for (int i = 0; i < n - 1; i++) {
//	for (int j = n - 1; j > i; j--) {
//		if (w[j - 1] < w[j]) {  /* 前の要素の方が大きかったら */
//			temp = w[j];        /* 交換する */
//			w[j] = w[j - 1];
//			w[j - 1] = temp;
//		}
//	}
//}