#P889E. Mod Mod Mod
Mod Mod Mod
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.
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 a single integer — 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.
2<br>10 5<br>
5<br>5 4 3 2 1<br>
4<br>5 10 5 10<br>
13<br>
6<br>
16<br>
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.