Buggy python submission (verdict: Runtime Error):
from fractions import gcd
from itertools import combinations

N = int(input())
a = list(map(int, input().split()))

b = list(accumulate([0] + a, gcd))
c = list(accumulate([0] + a[::-1], gcd))
l = list(gcd(s, t) for s, t in zip(b[:-1], c[::-1][1:]))
print(max(l))

Fixed submission:
from fractions import gcd
from itertools import accumulate

N = int(input())
a = list(map(int, input().split()))

b = list(accumulate([0] + a, gcd))
c = list(accumulate([0] + a[::-1], gcd))
l = list(gcd(s, t) for s, t in zip(b[:-1], c[::-1][1:]))
print(max(l))

Buggy python submission (verdict: Runtime Error):
from fractions import gcd
from itertools import combinations

N = int(input())
a = list(map(int, input().split()))

l = set(gcd(x, y) for x, y in list(combinations(a, 2)))
if 1 in l:
    remove(1)
print(max(l))


Fixed submission:
from fractions import gcd
from itertools import accumulate

N = int(input())
a = list(map(int, input().split()))

b = list(accumulate([0] + a, gcd))
c = list(accumulate([0] + a[::-1], gcd))
l = list(gcd(s, t) for s, t in zip(b[:-1], c[::-1][1:]))
print(max(l))

Buggy python submission (verdict: Runtime Error):
from math import gcd
# from fractions import gcd
from itertools import combinations

N = int(input())
a = list(map(int, input().split()))

l = set(gcd(x, y) for x, y in list(combinations(a, 2)))
if 1 in l:
    remove(1)
print(max(l))

Fixed submission:
from fractions import gcd
from itertools import accumulate

N = int(input())
a = list(map(int, input().split()))

b = list(accumulate([0] + a, gcd))
c = list(accumulate([0] + a[::-1], gcd))
l = list(gcd(s, t) for s, t in zip(b[:-1], c[::-1][1:]))
print(max(l))

Buggy python submission (verdict: Runtime Error):
from fractions import gcd
from itertools import permutations

N = int(input())
a = list(map(int, input().split()))

l = set(gcd(x, y) for x, y in list(permutations(a, 2)))
if 1 in l:
    remove(1)
print(min(l))

Fixed submission:
from fractions import gcd
from itertools import accumulate

N = int(input())
a = list(map(int, input().split()))

b = list(accumulate([0] + a, gcd))
c = list(accumulate([0] + a[::-1], gcd))
l = list(gcd(s, t) for s, t in zip(b[:-1], c[::-1][1:]))
print(max(l))

Buggy python submission (verdict: Runtime Error):
from math import gcd
from itertools import permutations

N = 3
a = [12, 15, 18]

l = set(gcd(x, y) for x, y in list(permutations(a, 2)))
if 1 in l:
    remove(1)
print(min(l))

Fixed submission:
from fractions import gcd
from itertools import accumulate

N = int(input())
a = list(map(int, input().split()))

b = list(accumulate([0] + a, gcd))
c = list(accumulate([0] + a[::-1], gcd))
l = list(gcd(s, t) for s, t in zip(b[:-1], c[::-1][1:]))
print(max(l))

Buggy python submission (verdict: Runtime Error):
from math import gcd
from itertools import permutations

N = int(input())
a = list(map(int, input().split()))

l = set(gcd(x, y) for x, y in list(permutations(a, 2)))
if 1 in l:
    remove(1)
print(min(l))

Fixed submission:
from fractions import gcd
from itertools import accumulate

N = int(input())
a = list(map(int, input().split()))

b = list(accumulate([0] + a, gcd))
c = list(accumulate([0] + a[::-1], gcd))
l = list(gcd(s, t) for s, t in zip(b[:-1], c[::-1][1:]))
print(max(l))