Cho mot mang so nguyen, tim gia tri lon nhat cua A(i)%A(j)

Chef and Dhyey have become friends recently. Chef wants to test Dhyey's intelligence by giving him a puzzle to solve.

The puzzle contains an integer sequence A1,A2,…,AN

. The answer to the puzzle is the maximum of Ai%Aj, taken over all valid i, j

.

Help Dhyey solve this puzzle.

Input

• The first line of each test case contains a single integer N

.

The second line contains N

space-separated integers A1,A2,…,AN

• .

Output

For each test case, print a single line containing one integer — the answer to the puzzle.

Constraints

• 2≤N≤105

1≤Ai≤109

for each valid i

• 
  

Subtasks

Subtask #1 (30 points): 2≤N≤1,000

Subtask #2 (70 points): 2≤N≤105

Example Input 1

5  
1 2 3 4 5  

Example Output 1

4  

Example Input 2

6  
5 5 5 2 3 8

Example Output 2

5

Author: 5★raj1238

Editorial: https://discuss.codechef.com/problems/MAXREM

Tags: april19, cakewalk, raj1238

Date Added: 23-03-2019

Time Limit: 1 secs

Source Limit: 50000 Bytes

Languages: C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, rust, SCALA, swift, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, kotlin, PERL6, TEXT, SCM chicken, PYP3, CLOJ, R, COB, FS

/**************/

#include <algorithm>
#include <cstdio>

int n = 0;
int a[1000005];

using namespace std;

int main() {
    scanf ("%d", &n);
    for (int i = 0; i < n; i++) {
        scanf ("%d", &a[i]);
    }

    struct {
        bool operator()(int a, int b) const {
            return a > b;
        }
    } uporedi;
    sort (a, a + n, uporedi);

    bool help = true;
    int temp = a[0];
    //printf("%d", temp);

    for (int i = 0; i < n; i++) {
        if (a[i] != temp) {
            help = false;
            printf("%d", a[i]);
            break;
        }
    }

    if (help) {
        printf("0");
    }

    return 0;
}