#include<bits/stdc++.h>
#include<regex>
#include<cctype>
using namespace std;
#define INFS (1LL<<28)
#define INF (1LL<<60)
#define DEKAI 1000000007
#define MOD 998244353
#define lp(i,n) for(int i=0;i<n;i++)
#define double long double
#define all(c) begin(c), end(c)

#define int long long 

namespace {
#define __DECLARE__(C)    \
    template <typename T> \
    std::ostream &operator<<(std::ostream &, const C<T> &);

#define __DECLAREM__(C)               \
    template <typename T, typename U> \
    std::ostream &operator<<(std::ostream &, const C<T, U> &);

__DECLARE__(std::vector)
__DECLARE__(std::deque)
__DECLARE__(std::set)
__DECLARE__(std::stack)
__DECLARE__(std::queue)
__DECLARE__(std::priority_queue)
__DECLARE__(std::unordered_set)
__DECLAREM__(std::map)
__DECLAREM__(std::unordered_map)

template <typename T, typename U>
std::ostream &operator<<(std::ostream &, const std::pair<T, U> &);
template <typename... T>
std::ostream &operator<<(std::ostream &, const std::tuple<T...> &);
template <typename T, std::size_t N>
std::ostream &operator<<(std::ostream &, const std::array<T, N> &);

template <typename Tuple, std::size_t N>
struct __TuplePrinter__ {
    static void print(std::ostream &os, const Tuple &t) {
        __TuplePrinter__<Tuple, N - 1>::print(os, t);
        os << ", " << std::get<N - 1>(t);
    }
};

template <typename Tuple>
struct __TuplePrinter__<Tuple, 1> {
    static void print(std::ostream &os, const Tuple &t) { os << std::get<0>(t); }
};

template <typename... T>
std::ostream &operator<<(std::ostream &os, const std::tuple<T...> &t) {
    os << '(';
    __TuplePrinter__<decltype(t), sizeof...(T)>::print(os, t);
    os << ')';
    return os;
}

template <typename T, typename U>
std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &v) {
    return os << '(' << v.first << ", " << v.second << ')';
}

#define __INNER__                             \
    os << '[';                                \
    for (auto it = begin(c); it != end(c);) { \
        os << *it;                            \
        os << (++it != end(c) ? ", " : "");   \
    }                                         \
    return os << ']';

template <typename T, std::size_t N>
std::ostream &operator<<(std::ostream &os, const std::array<T, N> &c) {
    __INNER__
}

#define __DEFINE__(C)                                           \
    template <typename T>                                       \
    std::ostream &operator<<(std::ostream &os, const C<T> &c) { \
        __INNER__                                               \
    }

#define __DEFINEM__(C)                                             \
    template <typename T, typename U>                              \
    std::ostream &operator<<(std::ostream &os, const C<T, U> &c) { \
        __INNER__                                                  \
    }

#define __DEFINEW__(C, M1, M2)                                  \
    template <typename T>                                       \
    std::ostream &operator<<(std::ostream &os, const C<T> &c) { \
        std::deque<T> v;                                        \
        for (auto d = c; !d.empty(); d.pop()) v.M1(d.M2());     \
        return os << v;                                         \
    }

__DEFINE__(std::vector)
__DEFINE__(std::deque)
__DEFINE__(std::set)
__DEFINEW__(std::stack, push_front, top)
__DEFINEW__(std::queue, push_back, front)
__DEFINEW__(std::priority_queue, push_front, top)
__DEFINE__(std::unordered_set)
__DEFINEM__(std::map)
__DEFINEM__(std::unordered_map)
}


#define rep(i,n) lp(i,n)
using Weight = double;
using Flow = int;
struct Edge {
    int src, dst;
    Weight weight;
    Flow cap;
    Edge() : src(0), dst(0), weight(0) {}
    Edge(int s, int d, Weight w) : src(s), dst(d), weight(w) {}
};
using Edges = std::vector<Edge>;
using Graph = std::vector<Edges>;
using Array = std::vector<Weight>;
using Matrix = std::vector<Array>;

void add_edge(Graph &g, int a, int b, Weight w = 1) {
    g[a].emplace_back(a, b, w);
    g[b].emplace_back(b, a, w);
}
void add_arc(Graph &g, int a, int b, Weight w = 1) { g[a].emplace_back(a, b, w); }


signed main(){
	while(1){
		int n;
		cin>>n;
		if(n==0)break;
		vector<int> s(n),c(n);
		lp(i,n)cin>>s[i]>>c[i];
		queue<pair<int,int>> q1,q2;
		vector<pair<int,int>> v;
		lp(i,n){
			c[i]*=2;
			v.push_back({s[i],i});
		}
		sort(all(v));
		lp(i,n){
			q1.push({v[i].first,v[i].second});
		}
		int ans=-1;
		while(1){
			if(q2.empty()){
				if(q1.empty()){
					break;
				}
				//1
				vector<pair<int,int>> l;
				int bef=INF;
				while(!q1.empty()){
					int time=q1.front().first;
					int num=q1.front().second;
					ans=max(ans,time);
					if(time>bef)break;
					q1.pop();
					if(bef==INF)bef=time;
					c[num]--;
					if(c[num]==0)continue;
					l.push_back({s[num],num});
				}
				sort(all(l));
				lp(i,l.size()){
					int num=l[i].second;
					q2.push({bef+s[num],num});
				}
			}
			else if(q1.empty()){
				//2
				vector<pair<int,int>> l;
				int bef=INF;
				while(!q2.empty()){
					int time=q2.front().first;
					int num=q2.front().second;
					ans=max(ans,time);
					if(time>bef)break;
					q2.pop();
					if(bef==INF)bef=time;
					c[num]--;
					if(c[num]==0)continue;
					l.push_back({s[num],num});
				}
				sort(all(l));
				lp(i,l.size()){
					int num=l[i].second;
					q1.push({bef+s[num],num});
				}
			}
			else if(q1.front().first<=q2.front().first){
				//1
				vector<pair<int,int>> l;
				int bef=INF;
				while(!q1.empty()){
					int time=q1.front().first;
					int num=q1.front().second;
					ans=max(ans,time);
					if(time>bef)break;
					q1.pop();
					if(bef==INF)bef=time;
					c[num]--;
					if(c[num]==0)continue;
					l.push_back({s[num],num});
				}
				sort(all(l));
				lp(i,l.size()){
					int num=l[i].second;
					q2.push({bef+s[num],num});
				}
			}
			else{
				//2
				vector<pair<int,int>> l;
				int bef=INF;
				while(!q2.empty()){
					int time=q2.front().first;
					int num=q2.front().second;
					ans=max(ans,time);
					if(time>bef)break;
					q2.pop();
					if(bef==INF)bef=time;
					c[num]--;
					if(c[num]==0)continue;
					l.push_back({s[num],num});
				}
				sort(all(l));
				lp(i,l.size()){
					int num=l[i].second;
					q1.push({bef+s[num],num});
				}
			}
		}
		cout<<ans<<endl;
	}
	return 0;
}
