CF879A

CF879A

A. Borya’s Diagnosis

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

It seems that Borya is seriously sick. He is going visit n doctors to find out the exact diagnosis. Each of the doctors needs the information about all previous visits, so Borya has to visit them in the prescribed order (i.e. Borya should first visit doctor 1, then doctor 2, then doctor 3 and so on). Borya will get the information about his health from the last doctor.

Doctors have a strange working schedule. The doctor i goes to work on the s**i-th day and works every d**i day. So, he works on days s**i, s**i + d**i, s**i + 2d**i, …

The doctor’s appointment takes quite a long time, so Borya can not see more than one doctor per day. What is the minimum time he needs to visit all doctors?

Input

First line contains an integer n — number of doctors (1 ≤ n ≤ 1000).

Next n lines contain two numbers s**i and d**i (1 ≤ s**i, d**i ≤ 1000).

Output

Output a single integer — the minimum day at which Borya can visit the last doctor.

Examples

input

Copy

3
2 2
1 2
2 2

output

Copy

4

input

Copy

2
10 1
6 5

output

Copy

11

Note

In the first sample case, Borya can visit all doctors on days 2, 3 and 4.

In the second sample case, Borya can visit all doctors on days 10 and 11.

---

先说说我自己是怎么做的吧。

感觉赛后看了看别人写的题解和代码，感觉自己写的好笨，我自己写的就是完全自己模拟一遍，也没通过数学推导来得出答案。

int now = d[1].s;
    int ans = d[1].s;
    for (int i = 2; i <= n; i++){
        int x = 0;
        while(now >= d[i].s + d[i].d * x){
            x++;
        }
        // cout << x << endl;
        ans = (d[i].s + d[i].d * x);
        now = d[i].s + d[i].d * x;
    }

---

i表示现在为第i天，j表示现在看到了第几个医生了。

由题意知，要想得到现在第i天能不能看这个医生，我们就需要判断(i - d[j].s) % d[j].d 是不是等于0，即判断倍数。如果不是就i变大一天。

int ans = 0;
    int num = 1;
    while(num <= n){
        ans++; //天数加一
        if(ans - d[num].s >= 0 && (ans - d[num].s) % d[num].d == 0){ // (ans - d[j].s) / d = x,
            num++;
        }
    }
    cout << ans << endl;