N = input()
X = map(int,raw_input().split())
D,A =[],[]
for i in range(0,N):
    if X[i] not in D:
        D.append(X[i])
D.sort()
for i in range(0,len(D)-1):
    A.append(D[i+1]-D[i])
print min(A)