#嘘解法
n = int(input())
s = [int(_) for _ in input().split()]
ans = 0
for i in range(n):
  left = 0
  right = min(i,n-i-1)+1
  while right > left+1:
    mid = (left+right)//2
    if s[i+mid]+s[i-mid] == s[i+mid-1]+s[i-mid+1] == s[i]*2:
      left = mid
    else:
      right = mid
  ans += left
for i in range(1,n):
  left = 1
  right = min(i,n-i)+1
  while right > left+1:
    mid = (left+right)//2
    if s[i-mid]+s[i+mid-1] == s[i-mid+1]+s[i+mid-2] == s[i-1] + s[i]:
      left = mid
    else:
      right = mid
  ans += left
print(ans+n)