#include <cstdio>

#include <algorithm>

using namespace std;

const int MAX_N=100000;

int n,h[MAX_N],L[MAX_N],R[MAX_N],st[MAX_N],w[MAX_N],s[MAX_N];

void solve(){

    int top=0;

    for(int i=0;i<n;i++){

        while(top>0&&h[st[top-1]]>=h[i])top--;

        L[i]=top==0?0:(st[top-1]+1);

        st[top++]=i;

    }top=0;

    for(int i=n-1;i>=0;i--){

        while(top>0&&h[st[top-1]]>=h[i])top--;

        R[i]=top==0?0:st[top-1];

        st[top++]=i;

    }

    long long res=0;

    for(int i=0;i<n;i++){

        res=max(res,(long long)h[i]*(s[R[i]]-s[L[i]]));

    }printf("%lld\n",res);

}

int main(){

    while(scanf("%d",&n),n!=-1){

        for(int i=1;i<=n;i++)scanf("%d%d",&w[i],&h[i]),s[i+1]=s[i]+w[i];

        h[n+1]=0;n+=2;

        solve();

    }return 0;

}