def gcd(a,b):
  if b<=0:
    return a
  else:
    return gcd(b,a%b)
N=int(input())
A=list(map(int,input().split()))
print(0)
if N==1:
	exit()
ans=abs(A[0]-A[1])
print(ans)
for i in range(2,N):
	ans=gcd(max(ans,abs(A[0]-A[i])),min(abs(A[0]-A[i]),ans))
	print(ans)