def longestArithSeqLength(array):
result = 1
length = [{} for _ in range(len(array))]
for i in range(1,len(array)):
for j in range(i):
diff = array[i] - array[j]
n = length[j].get(diff,1)+1
length[i][diff] = n
result = max(result,max(length[i].values()))
return result