Problem:
Score : 300 points

Problem Statement

AtCoDeer the deer is seeing a quick report of election results on TV.
Two candidates are standing for the election: Takahashi and Aoki.
The report shows the ratio of the current numbers of votes the two candidates have obtained, but not the actual numbers of votes.
AtCoDeer has checked the report N times, and when he checked it for the i-th (1≦i≦N) time, the ratio was T_i:A_i.
It is known that each candidate had at least one vote when he checked the report for the first time.

Find the minimum possible total number of votes obtained by the two candidates when he checked the report for the N-th time.
It can be assumed that the number of votes obtained by each candidate never decreases.

Constraints

1≦N≦1000

1≦T_i,A_i≦1000 (1≦i≦N)

T_i and A_i (1≦i≦N) are coprime.

It is guaranteed that the correct answer is at most 10^{18}.

Input

The input is given from Standard Input in the following format:

N
T_1 A_1
T_2 A_2
:
T_N A_N

Output

Print the minimum possible total number of votes obtained by Takahashi and Aoki when AtCoDeer checked the report for the N-th time.

Sample Input 1

3
2 3
1 1
3 2

Sample Output 1

10

When the numbers of votes obtained by the two candidates change as 2,3 → 3,3 → 6,4, the total number of votes at the end is 10, which is the minimum possible number.

Sample Input 2

4
1 1
1 1
1 5
1 100

Sample Output 2

101

It is possible that neither candidate obtained a vote between the moment when he checked the report, and the moment when he checked it for the next time.

Sample Input 3

5
3 10
48 17
31 199
231 23
3 2

Sample Output 3

6930

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		long[]T = new long[N];
		long[]A = new long[N];
		for(int i = 0; i < N; i++) {
			T[i] = sc.nextLong();
			A[i] = sc.nextLong();
		}
		sc.close();
		long k = gcd(T[0], A[0]);
		long x = T[0];
		long y = A[0];
		for(int i = 1; i < N; i++) {
			long n1 = T[i];
			long n2 = A[i];
			long k1 = T[i] - x;
			long k2 = A[i] - y;
			if(k1 == 0 && k2 == 0) continue;
			long m = 1;
			long l = 0;
			long r = 10000000000000000l;
			long mid = 0;
			while(r - l > 1) {
				mid = (r + l) / 2;
				k1 = n1 * mid - x;
				k2 = n2 * mid - y;
				if(k1 == 0 && k2 == 0) {
					//System.out.println("a");
					break;
				}
				if(k1 >= 0 && k2 >= 0) {
					r = mid;
				}else {
					l = mid;
				}
			}
			k1 = T[i] * mid - x;
			k2 = A[i] * mid - y;
			if(k1 < 0 || k2 < 0) {
				mid ++;
			}
			k1 = T[i] * mid - x;
			k2 = A[i] * mid - y;
			if(k1 < 0 || k2 < 0) {
				mid ++;
			}
			k1 = T[i] * mid - x;
			k2 = A[i] * mid - y;
			x += k1;
			y += k2;
			//System.out.printf("%d %d %d %d %d \n", x, y, k1, k2, mid);
		}
		long ans = x + y;
		System.out.println(ans);
	}
	static long gcd(long n, long m) {
		if(n > m) {
			return gcd(m, n);
		}
		long k = m % n;
		if(k == 0) {
			return n;
		}else {
			return gcd(n, k);
		}
	}
}