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

def gcd(a,b):
    while b:
        r = a % b
        a = b
        b = r
    return a

import sys

print(0)
if N == 1:
    exit()
print(abs(A[0] - A[1]))
g = abs(A[0] - A[1])

for i in range(2,N):
    u = abs(A[i] - A[i-1])
    g = gcd(g,u)
    print(g)