#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#define max(a,b) ((a) > (b) ? (a) : (b))
#define min(a,b) ((a) > (b) ? (b) : (a))
#define lowbit(a) ((a) & (-(a)))

int read()
{
    int x = 0;char ch = getchar();char c = ch;
    while(ch > ‘9‘ || ch < ‘0‘)c = ch, ch = getchar();
    while(ch <= ‘9‘ && ch >= ‘0‘)x = x * 10 + ch - ‘0‘, ch = getchar();
    if(c == ‘-‘)return -x;
    return x;
}

const int INF = 0x3f3f3f3f;
const int MAXNUM = 1000000;
const int MAXN = 1000 + 10;
int num[2][MAXNUM];
int* ans;int* tmp;
int s[MAXNUM];

int n;
struct T
{
    int l,r;
}a[MAXN];

bool cmp(T a, T b)
{
    return a.l * a.r < b.l * b.r;
}

inline void init()
{
   n = read();
   for(int i = 1;i <= n + 1;i ++)
   {
        a[i].l = read();a[i].r = read();
   }
   ans = num[0];
   tmp = num[1];
}

inline void cheng(int k)
{
    for(int i = 1;i <= s[0];i ++)
    {
        s[i] *= k;
    } 
    int i = 1;
    while(i <= s[0])
    {
        if(s[i] >= 10)
        {
            int t = s[i] / 10;
            s[i + 1] += t;
            s[i] = s[i] - t * 10;
        }
        i ++;
    }
    while(s[i] >= 10)
    {
        int t = s[i] / 10;
        s[i + 1] += t;
        s[i] = s[i] - t * 10;
        i ++;
    }
    if(s[i] == 0)
        s[0] = i - 1;
    else
        s[0] = i;
}

int yu[MAXNUM];
inline void chu(int k)
{
    int i = 0;
    int j = s[0];
    bool ok = true;
    for(j =s[0];j >= 1 && ok;j --)
    {
        yu[j] += s[j];
        if(yu[j] >= k)
        {
            i ++;
            tmp[i] = yu[j] / k;
            yu[j] = yu[j] - tmp[i] * k;
            ok = false;
        }
        yu[j - 1] = yu[j] * 10;
        yu[j] = 0;
    }
    for(;j >= 1;j --)
    {
        yu[j] += s[j];
        i ++;
        if(yu[j] >= k)
        {
            tmp[i] = yu[j] / k;
            yu[j] = yu[j] - tmp[i] * k;
        }
        else
        {
            tmp[i] = 0;
        }
        yu[j - 1] = yu[j] * 10;
    }
    tmp[0] = i;
}

inline void put()
{
    if(ans[0] == 0)
    {
        printf("0");
        return;
    }
   for(int i = 1;i <= ans[0];i ++)
   {
        printf("%d", ans[i]);
   }
}

inline void bijiao()
{
    bool b = true;
    if(ans[0] > tmp[0]) b = false;
    else if(ans[0] == tmp[0])
    {
        int i = 1;
        while(ans[i] == tmp[i])i++;
        if(ans[i] > tmp[i])b = false;
    }
    if(b)
    {
        int* a = tmp;
        tmp = ans;
        ans = a;
    }
}

inline void tan()
{
    std::sort(a + 2, a + 2 + n, cmp);
    s[0] = 1;s[1] = 1;
    for(int i = 2;i <= n + 1;i ++)
    {
        memset(tmp, 0, sizeof(tmp));
        cheng(a[i - 1].l);
        chu(a[i].r);
        bijiao();
    }
}

int main()
{
    init();
    tan();
    put();
    return 0;
}