#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<cstdio>
#include<cmath>
#include<numeric>
#include<queue>
#include<stack>
#include<cstring>
#include<limits>
#include<functional>
#include<unordered_set>
#include<iomanip>
#include<cassert>
#define rep(i,a) for(int i=(int)0;i<(int)a;++i)
#define pb push_back
#define eb emplace_back
using ll=long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 50;
 
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
using namespace std;

void solve(){
    ll n;
    cin>>n;
    vector<ll>b(n);
    vector<ll>pos;
    for(ll i=0;i<n;++i){
        cin>>b[i];
        if(b[i]>1)pos.pb(i);
    }
    int p=0;
    ll cnt=0;
    for(ll i=0;i<n;++i){
        if(!b[i]){
            cnt+=abs(pos[p]-i);
            --b[pos[p]];
            if(b[pos[p]]==1LL)++p;
        }
    }
    cout<<cnt<<"\n";
}
 
signed main(){
	ios::sync_with_stdio(false);
    cin.tie(0);
	cout<<fixed<<setprecision(15);
	solve();
	return 0;
}