#include <bits/stdc++.h>
using namespace std;
const int N = 4e5 + 5; 

int n; 
int a[N]; 
vector<int> p[N]; 
bool vis[N]; 

struct Fenwick {
    int C[N]; 
    inline void add(int x, int k) { for (; x <= n; x += x & -x) C[x] += k; }
    inline int sum(int x) { int r = 0; for (; x; x -= x & -x) r += C[x]; return r; }
    inline int sum(int l, int r) { return sum(r) - sum(l - 1); }
} T; 

long long count_swaps(vector<int> a) {
    n = a.size(); 
    a.push_back(0); 
    for (int i = n; i >= 1; --i) a[i] = a[i - 1]; 
    for (int i = 1; i <= n; ++i) {
        p[a[i] + n].push_back(i); 
        T.add(i, 1); 
    }
    long long ans = 0; 
    for (int i = n; i >= 1; --i) if (!vis[i]) {
        vis[i] = 1; p[a[i] + n].pop_back(); 
        int res = p[n - a[i]].back(); p[n - a[i]].pop_back(); 
        T.add(res, -1); T.add(i, -1); 
        vis[res] = 1; ans += T.sum(res, i) + (a[i] < 0); 
        // cerr << res << " " << i << "\n"; 
    }
    cout << ans << "\n"; 
    return 0;
}