N = int(input())
A = list(map(int,input().split()))
ans = (N*(N+1))//2+1
for k in range(1,30+1):
    C = {0:[]}
    A0 = [0]+[A[i]-k for i in range(N)]
    B = [0]*(N+1)
    for i in range(1,N+1):
        B[i] = B[i-1]+A0[i]
    cnt = 1
    for i in range(1,N+1):
        if B[i]==B[i-1]:
            cnt += 1
        else:
            if B[i] not in C:
                C[B[i]] = []
            C[B[i-1]].append(cnt)
            cnt = 1
    C[B[N]].append(cnt)
    for a in C:
        n = sum(C[a])
        ans -= (n*(n-1))//2
        m = len(C[a])
        ans += (m*(m-1))//2
print(ans)