Preparando MOJI

Mod Mod Mod

2000ms 262144K

Description:

You are given a sequence of integers a1, a2, ..., an. Let , and for 1 ≤ i < n. Here, denotes the modulus operation. Find the maximum value of f(x, 1) over all nonnegative integers x.

Input:

The first line contains a single integer n (1 ≤ n ≤ 200000) — the length of the sequence.

The second lines contains n integers a1, a2, ..., an (1 ≤ ai ≤ 1013) — the elements of the sequence.

Output:

Output a single integer — the maximum value of f(x, 1) over all nonnegative integers x.

Sample Input:

2
10 5

Sample Output:

13

Sample Input:

5
5 4 3 2 1

Sample Output:

6

Sample Input:

4
5 10 5 10

Sample Output:

16

Note:

In the first example you can choose, for example, x = 19.

In the second example you can choose, for example, x = 3 or x = 2.

Informação

Codeforces

Provedor Codeforces

Código CF889E

Tags

binary searchdpmath

Submetido 0

BOUA! 0

Taxa de BOUA's 0%

Datas 09/05/2023 09:20:31

Relacionados

Nada ainda