import sys

def modulo(k,z):
    if k<z: return k #맨마지막 연산
    r=modulo(k//2,z)
    if k%2==0: return (r+r)%z
    else: return (r+r+1)%z

n=int(input())
r=sorted(list(map(int,sys.stdin.read().split())))
p=[]
for i in range(n-1):
    p.append(r[1]-r[0])
    r.pop(0)
p.sort()
for j in range(p[0],1,-1):
    f=set()
    for k in p:
        f.add(modulo(k,j))
        if len(f)>1: break
    if len(f)==1: break

d,d_b=[],[]
for v in range(1,int(j**.5)+1):
    if j%v==0:
        d.append(v)
        if v!=(j//v):
            d_b.append(j//v)
for w in d[1:]+d_b[::-1]: print(w)