#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000001

int op(int a,int b){
	return a*b;
}

int e(){
	return 1;
}

int main(){
	
	int N;
	cin>>N;
	
	vector<int> A(N);
	rep(i,N){
		cin>>A[i];
	}
	
	segtree<int,op,e> seg(A);
	
	long long ans = 0LL;
	
	rep(i,N){
		int ok = i,ng = N+1;
		while(ng-ok>1){
			int mid = (ok+ng)/2;
			if(seg.prod(i,mid)==1)ok = mid;
			else ng=  mid;
		}
		ans += ok - i;
	}
	
	ans -= ((long long)N*(N+1))/2;
	ans *= -1;
	
	cout<<ans<<endl;
	
    return 0;
}