Problem: Despite urging requests of the townspeople, the municipal office cannot afford to improve many of the apparently deficient city amenities under this recession. The city swimming pool is one of the typical examples. It has only two swimming lanes. The Municipal Fitness Agency, under this circumstances, settled usage rules so that the limited facilities can be utilized fully.

Two lanes are to be used for one-way swimming of different directions. Swimmers are requested to start swimming in one of the lanes, from its one end to the other, and then change the lane to swim his/her way back. When he or she reaches the original starting end, he/she should return to his/her initial lane and starts swimming again.

Each swimmer has his/her own natural constant pace. Swimmers, however, are not permitted to pass other swimmers except at the ends of the pool; as the lanes are not wide enough, that might cause accidents. If a swimmer is blocked by a slower swimmer, he/she has to follow the slower swimmer at the slower pace until the end of the lane is reached. Note that the blocking swimmer’s natural pace may be faster than the blocked swimmer; the blocking swimmer might also be blocked by another swimmer ahead, whose natural pace is slower than the blocked swimmer. Blocking would have taken place whether or not a faster swimmer was between them.

Swimmers can change their order if they reach the end of the lane simultaneously. They change their order so that ones with faster natural pace swim in front. When a group of two or more swimmers formed by a congestion reaches the end of the lane, they are considered to reach there simultaneously, and thus change their order there.

The number of swimmers, their natural paces in times to swim from one end to the other, and the numbers of laps they plan to swim are given. Note that here one "lap" means swimming from one end to the other and then swimming back to the original end. Your task is to calculate the time required for all the swimmers to finish their plans. All the swimmers start from the same end of the pool at the same time, the faster swimmers in front.

In solving this problem, you can ignore the sizes of swimmers' bodies, and also ignore the time required to change the lanes and the order in a group of swimmers at an end of the lanes.



Input

The input is a sequence of datasets. Each dataset is formatted as follows.

n
t1 c1
...
tn cn


n is an integer (1 ≤ n ≤ 50) that represents the number of swimmers. ti and ci are integers (1 ≤ ti ≤ 300, 1 ≤ ci ≤ 250) that represent the natural pace in times to swim from one end to the other and the number of planned laps for the i-th swimmer, respectively. ti and ci are separated by a space.

The end of the input is indicated by a line containing one zero.

Output

For each dataset, output the time required for all the swimmers to finish their plans in a line. No extra characters should occur in the output.

Example

Input

2
10 30
15 20
2
10 240
15 160
3
2 6
7 2
8 2
4
2 4
7 2
8 2
18 1
0


Output

600
4800
36
40

Solution (in CPP):

Solution:
#include<iostream>
#include<string>
#include<vector>
#include<tuple>
#include<stack>
#include<set>
#include<algorithm>
using namespace std;

#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define DBG 0
const int INF = 1e9;
int main() {
	while (1) {
		int n;
		cin >> n;
		if (n == 0) break;
		vector<int> t(n), c(n);
		rep(i, 0, n) {
			cin >> t[i] >> c[i];
		}

		set<pair<int, int>> S1, S2;

		{  // init
			rep(i, 0, n) {
				S1.insert({t[i], i});
			}
		}

		int ans = 0;
		while (S1.size() || S2.size()) {
			if (DBG) {
				cout << "S1.size() = " << S1.size() << ", S2.size() = " << S2.size() << endl;
			}

			set<tuple<int, int, bool>> next;
			int a = INF, b = INF;
			if (not S1.empty())a = S1.begin()->first;
			if (not S2.empty())b = S2.begin()->first;
			int T = min(a,b);
			while (!S1.empty()) {
				int x, idx;
				tie(x, idx) = *S1.begin();
				if (x != T) break;
				next.insert(make_tuple(T + t[idx], idx, false));
				S1.erase(S1.begin());
			}
			while (!S2.empty()) {
				int x, idx;
				tie(x, idx) = *S2.begin();
				if (x != T) break;
				next.insert(make_tuple(T + t[idx], idx, true));
				S2.erase(S2.begin());
			}

			for (auto& tpl : next) {
				int nt, idx;
				bool f;
				tie(nt, idx, f) = tpl;
				if (f) {
					// into S1
					if (!S1.empty()) {
						auto itr = S1.rbegin();
						nt = max(nt, get<0>(*itr));
					}

					// decrease c
					c[idx]--;
					if (DBG) {
						cout << "! c ";

						rep(i, 0, n) {
							cout << c[i] << (i == n - 1 ? '\n' : ' ');
						}
					}
					if (c[idx] > 0) {
						S1.insert({ nt, idx });
					}
					else {
						ans = max(ans, nt - t[idx]);  // !!
					}
				}
				else {
					// into S2
					if (!S2.empty()) {
						auto itr = S2.rbegin();
						nt = max(nt, get<0>(*itr));
					}
					S2.insert({ nt, idx });
				}
			}
		}
		cout << ans << endl;
	}
	return 0;
}