#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <optional>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

int main() {
    int32_t n;
    cin >> n;
    vector<bool> as(n);
    for (auto &&a : as) {
        int32_t x;
        cin >> x;
        a = x == 1;
    }
    vector<int64_t> rl;
    int64_t cnt = 0;
    for (auto a : as) {
        if (a)
            ++cnt;
        else {
            rl.push_back(cnt);
            cnt = 0;
        }
    }
    rl.push_back(cnt);
    int64_t c = 0;
    for (auto x : rl) {
        c += x * (x + 1) / 2;
    }
    cout << int64_t(n) * (n + 1) / 2 - c << endl;
    return 0;
}