import sys
input = lambda:sys.stdin.readline().strip()
res = 0
n = int(input())
a = list(map(int, input().split()))
ans = 0
def add(x):
    while x <= n + n + 1:
        f[x] += 1
        x += x & -x

def get(x):
    res = 0
    while x > 0:
        res += f[x]
        x -= x & -x
    return res
f = [0] * (n + n + 2)
ans = 0
add(n + 1)
for v in a:
    if v == 1:
        ans -= 1
    else:
        ans += 1
    res += get(ans + n)
    add(ans + n + 1)
r = n * (n + 1) // 2 - res
print(res * 2 + r)

import java.util.*;
import java.io.*;
// 注意类名必须为Main
class Node{
    int left;
    int right;
    int val;
    public Node(int l,int r){
        left = l;
        right = r;
    }
    public String toString(){
        return left+" "+right+" "+val;
    }
}
class Main {
    static int n;
    static int[] a;
    static int[] diff;
    static long m = 0;
    static Node[] tree;
    public static long aaa(){
        //初始化diff数组
        //diff范围 -n --> n
        bbb();
        //建树
        tree = new Node[8*n];
        ccc();
        //插入第一条数据diff[0]
        // add(diff[0]);
        //遍历diff数组
        for(int i=0;i<n;i++){
            m += select(-n,diff[i]-1);
            add(diff[i]);
            if(diff[i]>0){
                m++;
            }
            // System.out.print(diff[i]+" ");
        }
        // for(int i=0;i<n;i++){
        // for(int i=0;i<8*n;i++){
        //     System.out.println(tree[i]);
        // }
        // System.out.println(m);
        return m + 1L*(n+1)*n/2;
    }
    public static long select(int leftNum,int rightNum){
        if(rightNum < leftNum){
            return 0;
        }
        return diguiSelect(1,leftNum,rightNum);
    }
    public static long diguiSelect(int treeIndex,int leftNum,int rightNum){
        Node node = tree[treeIndex];
        if(node.left > rightNum || node.right < leftNum){
            return 0;
        }
        if(node.left >= leftNum && node.right <= rightNum){
            return node.val;
        }
        return diguiSelect(treeIndex*2,leftNum,rightNum) + diguiSelect(treeIndex*2+1,leftNum,rightNum);

    }
    public static void add(int num){
        Node node = tree[1];
        int treeIndex = 1;
        while(node.left != node.right){
            node.val++;
            if(num >= tree[treeIndex*2].left && num <= tree[treeIndex*2].right){
                treeIndex = treeIndex*2;
                // node = tree[treeIndex];
            }else{
                treeIndex = treeIndex*2+1;
                // node = tree[treeIndex*2+1];
            }
            node = tree[treeIndex];
        }
        node.val++;
    }
    public static void ccc(){
        tree[1] = new Node(-n,n);
        digui(1);
    }
    public static void digui(int nodeIndex){
        if(tree[nodeIndex].left == tree[nodeIndex].right){
            return;
        }
        int mid = (tree[nodeIndex].left+tree[nodeIndex].right)/2;
        if(tree[nodeIndex].right <= 0){
            tree[2*nodeIndex] = new Node(tree[nodeIndex].left,mid-1);
            tree[2*nodeIndex+1] = new Node(mid,tree[nodeIndex].right);
        }else{
            tree[2*nodeIndex] = new Node(tree[nodeIndex].left,mid);
            tree[2*nodeIndex+1] = new Node(mid+1,tree[nodeIndex].right);
        }

        digui(2*nodeIndex);
        digui(2*nodeIndex+1);
    }
    public static void bbb(){
        int n1 = 0;
        int n2 = 0;
        diff = new int[n];
        for(int i=0;i<n;i++){
            if(a[i] == 1){
                n1++;
            }else{
                n2++;
            }
            diff[i] = n2-n1;
        }
    }
    public static void main(String[] args) throws Exception {
        // Scanner sc = new Scanner(System.in);
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        // n = sc.nextInt();
        n = Integer.parseInt(reader.readLine());
        a = new int[n];
        String[] ss = reader.readLine().split(" ");
        for(int i=0;i<n;i++){
            // int t = ;
            a[i] = (ss[i].charAt(0) == '1') ? 1 : 2;
        }
        System.out.println(aaa());

    }
}