//关于高精

//倒着存  都是高精和低精 B取的低精最大值所以简化了一点

//小新chuInt-->B大g可能溢出

#include <iostream>

#include <cstdio>

#include <cstring>

#include <cmath>

#include <algorithm>

using namespace std;

const int N=,B=1e4,W=,L=;

struct people{

    int a,b,t;

}p[N];

bool cmp(people x,people y){

    return x.t<y.t;

}

struct big{

    int size,d[L];

    big(int a=):size(a){memset(d,,sizeof(int)*L);}

};

bool bigger(big &a,big &b){

    if(a.size>b.size) return true;

    if(a.size<b.size) return false;

    for(int i=a.size-;i>=;i++){

        if(a.d[i]>b.d[i]) return true;

    }

    return false;

}

void copy(big &t,big &s){

    t.size=s.size;

    memcpy(t.d,s.d,sizeof(int)*L);

}

void chengInt(big &a,int k){

    int g=,i;

    for(i=;i<a.size;i++){

        int tmp=a.d[i]*k;

        a.d[i]=(tmp+g)%B;

        g=(tmp+g)/B;

    }

    while(g){

        a.d[i++]=g%B; a.size++;

        g/=B;

    }

}

void chuInt(big &a,int k){

    int g=;

    for(int i=a.size-;i>=;i--){

        g=g*B+a.d[i];

        a.d[i]=g/k;

        g%=k;

    }

    while(a.d[a.size-]==) a.size--;

}

//原来的弱智方法

//void chuInt(big &a,int k,big &ans){

//    while(noSmallInt(a,k))

//    {jianInt(a,k);addInt(ans,1);}

//}

//void chuInt(big &a,int k,int &ans){

//    while(noSmallInt(a,k))

//    {jianInt(a,k);ans++;}

//}

int n;

big s,t,mx;

int main(int argc, const char * argv[]) {

    scanf("%d",&n);

    for(int i=;i<=n;i++){scanf("%d%d",&p[i].a,&p[i].b); p[i].t=p[i].a*p[i].b;}

    sort(p+,p+n+,cmp);

    s.d[]=p[].a;

    for(int i=;i<=n;i++){for(int i=s.size-;i>=;i--)

        copy(t,s);

        chuInt(t,p[i].b);

        if(bigger(t,mx)) copy(mx,t);

        chengInt(s,p[i].a);

    }

    for(int i=mx.size-;i>=;i--){

        if(i!=mx.size-){

            if(mx.d[i]<) cout<<"";

            else if(mx.d[i]<) cout<<"";

            else if(mx.d[i]<) cout<<"";

        }

        cout<<mx.d[i];

    }

}