#include<iostream>
using namespace std;
#include<algorithm>
#include<vector>
#include<unordered_map>
#include<queue>
#include<set>
#include<iomanip>
#include<cmath>
#include<string>
#include<sstream>




#define N 4000
int mxL = 0;
struct DC
{
	int a, b;
	int reverse_order[N];
	int L;
}s[1100];
bool cmp(DC& s1, DC& s2)   //贡献排序
{
	return s1.a * s1.b < s2.a * s2.b;
}
void mult(int a[],int b[],int t,int L,int i)//大臣之前的乘积计算(倒序
{
	int g = 0;
	for (int i = 0;i< L + 4; i++)
	{
		b[i] = a[i] * t + g;
		g = b[i] / 10;
		b[i] = b[i] % 10;
	}
	int LL = L + 4;

	while (b[LL] == 0 && LL > 0)LL--;
	s[i].L = LL;
}
void Division(int a[], int t,int L,int k) //除法
{
	int g = 0;
	for (int i = L; i >= 0; i--)
	{
		int temp = a[i];
			a[i] = (a[i] + g*10) / t;
			g = (temp + g * 10) % t;
	}
	while (a[s[k].L] == 0 && s[k].L > 0)s[k].L--;
}
bool Compare(int a,int b)  //比较
{
	if (s[a].L != s[b].L)
		return s[a].L < s[b].L;
	else
	{
		for (int i = s[a].L; i >= 0; i--)
			if (s[a].reverse_order[i] != s[b].reverse_order[i])return s[a].reverse_order[i] < s[b].reverse_order[i];
	}
}
int main()
{
	int n;
	cin >> n;
	cin >> s[0].a >> s[0].b;
	for (int i = 1; i <= n; i++)
		cin >> s[i].a >> s[i].b;
	sort(s + 1, s + 1 + n, cmp);
	s[0].reverse_order[0] = 1;
	s[0].L = 4;
	for (int i = 1; i <= n; i++)
	{
		mult(s[i - 1].reverse_order, s[i].reverse_order, s[i - 1].a, s[i - 1].L, i);
	}

	for (int i = 1; i <= n; i++)
	{
		Division(s[i].reverse_order, s[i].b,s[i].L,i);
	}
	//for (int i = 1; i <= n; i++)
	//{
	//	for (int j = s[i].L; j >= 0; j--)
	//		cout << s[i].reverse_order[j];
	//	cout << endl;
	//}
	int mx = 1;
	
	for (int i = 2; i <= n; i++)
	{
		if (Compare(mx, i))
		{
			mx = i;
		}
	}
	for (int i = s[mx].L; i >= 0; i--)
		cout << s[mx].reverse_order[i];
	return 0;
}