Maximum Value

1000ms

262144K

Description:

You are given a sequence a consisting of n integers. Find the maximum possible value of $\text{[math]}$ (integer remainder of a_i divided by a_j), where 1 ≤ i, j ≤ n and a_i ≥ a_j.

Input:

The first line contains integer n — the length of the sequence (1 ≤ n ≤ 2·10⁵).

The second line contains n space-separated integers a_i (1 ≤ a_i ≤ 10⁶).

Output:

Print the answer to the problem.

Sample Input:

3
3 4 5

Sample Output:

Informação

Provedor Codeforces

Código CF484B