n,*A=map(int,open(0).read().split());v=x=min(2,n)
while n>2:n-=1;x=max(x,v:=[2,v+1][A[n]+A[n-2]==A[n-1]*2])
print(x)