题目描述
Consider an infinite sequence a_1, a_2, … Initially, the values of all the terms are 0, and from this state we will sequentially perform Q operations. The i-th operation (1 ≤ i ≤ Q) is as follows:
- For every positive integer j, add x_i to the value of a_{j × m_i}.
Find the value of the largest term after these Q operations.
Constraints
- 1 ≤ Q ≤ 299
- 2 ≤ m_i ≤ 300
- -10^6 ≤ x_i ≤ 10^6
- All m_i are distinct.
- All input values are integers.
Input
Input is given from Standard Input in the following format:
Q
m_1 x_1
:
m_Q x_Q
Output
Print the value of the largest term after the Q operations.
Examples
Input
3
2 10
3 -20
6 15
Output
10
Input
3
10 -3
50 4
100 -5
Output
1
Input
5
56 114834
72 -149861
100 190757
192 -132693
240 133108
Output
438699
输入格式
见题面
输出格式
见题面
样例输入
3
10 -3
50 4
100 -5
样例输出
1