#include<bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pb push_back
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
ordered_set ord;
set<int>st[200005];
int n,a[200005],fix[200005];
vector<int>gg;
ll d(int x){
if(ord.size() == 0)return 0;
if(x < (*ord.begin()))
return 0;
return ord.order_of_key(x) + 1;
}
ll count_swaps(vector<int>v){
ll ans = 0;
ll n = (int)v.size();
for(int i=1; i<=n; i++){
a[i] = v[i - 1];
st[a[i] + n].insert(i);
}
for(int i=1; i<=n; i++){
if(fix[i])continue;
if(a[i] > 0)ans++;
st[a[i] + n].erase(st[a[i] + n].find(i));
ll ind = (*st[-a[i] + n].begin());
fix[ind] = 1;
st[-a[i] + n].erase(st[-a[i] + n].begin());
ll ind1 = ind;
ll k = (int)ord.size() - d(i);
ll f = (int)ord.size() - d(ind);
ans += (ind + f) - (i + k) - 1;
ord.insert(ind1);
}
return ans;
}
/*
int main(){
cin >> n;
for(int i=1; i<=n; i++){
int x;
cin >> x;
gg.pb(x);
}
ll itisans = count_swaps(gg);
cout << itisans << endl;
return 0;
}
*/
