ingle-s”>#!/bin/python3 import sys def solve(A): length = len(A) pem = [] for i in range(0, length): for j in range(i, length): pem.append(A[i:j+1]) def all(all): found = 0 for i in all: temp = -1 for j in i: if j == 0: temp = 1 else: temp = temp * j if temp == 0: found += 1 return found return all(pem) if __name__==”__main__”: length= int(input()) A = list(map(int, sys.stdin.readline().split())) print(solve(A))