p01880 Best Matched Pair_5111
Example

Input

2
1 2


Output

2
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 998244353

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)


def main():
    rr = []

    while True:
        n = I()
        a = LI()
        r = -1
        for i in range(n):
            b = a[i]
            for c in a[i+1:]:
                t = b*c
                if r >= t:
                    continue
                s = str(t)
                if all([int(s[k]) == int(s[k+1])-1 for k in range(len(s)-1)]):
                    r = t

        rr.append(r)
        break

    return '\n'.join(map(str, rr))


print(main())


