#include<bits/stdc++.h>

using namespace std;
using ll = long long;
using pint = pair<int,int>;

template<class T> 
vector<pair<T, int>> RLE(vector<T> vec) {
	vector<pair<T, int>> ret = {{vec.front(), 1}};

	for(int i = 1; i < (int)vec.size(); i++) {
		if(vec[i - 1] == vec[i]) ret.back().second++;
		else {
			ret.push_back({vec[i], 1});
		}
	}
	return ret;
}

int main()
{
	int N; cin >> N;
	vector<int> A(N);
	for(auto &i : A) {
		cin >> i;
		i = (i == 0 ? 0 : 1);
	}

	auto v = RLE(A);
	ll sum  =0;
	for(auto [u, v] : v) {
		if(u == 0)continue;
		sum += (ll)v * (v + 1) / 2;
	}

	cout << (ll)(N) * (N + 1) / 2 - sum << endl;

}