import sys # sys.setrecursionlimit(200005) int1 = lambda x: int(x)-1 p2D = lambda x: print(*x, sep="\n") def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() # dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] inf = 10**16 # md = 998244353 md = 10**9+7 from itertools import permutations from math import gcd n = II() ac = LI() if n < 8: aa = [] for a, c in enumerate(ac, 1): aa += [str(a)]*c ans = 0 for dd in permutations(aa): cur = int("".join(dd)) ans = gcd(ans, cur) print(ans) exit() aa, cc = [], [] for a, c in enumerate(ac, 1): if c: aa.append(a) cc.append(c) if len(aa)==1: ans=str(aa[0])*cc[0] print(ans) exit() g = 0 for a in aa: g = gcd(g, a) s = 0 for a, c in zip(aa, cc): s += a*c if s%9 == 0: g *= 9 elif s%3 == 0: g *= 3 print(g)