#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define plx pair<ll,int>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vvi vector<vi>
#define pp pair<ll,int>
#define ub(x,i) upper_bound(all(x),i)-x.begin()
#define lb(x,i) lower_bound(all(x),i)-x.begin()
#define t3 tuple<int,int,int>
using namespace std;
const int mxn=2e5+5;
ll fw[mxn]{0};
void add(int i,int amt){
for(;i<mxn;i+=i&-i)fw[i]+=amt;
}
int qr(int i,int rs=0){
for(;i;i-=i&-i)rs+=fw[i];
return rs;
}priority_queue<int,vector<int>,greater<int>>v[mxn],vv[mxn];
priority_queue<pii,vector<pii>,greater<pii>>p1,p2;
bool vis[mxn]{0};
long long count_swaps(std::vector<int> s){
int n=s.size();ll ans=0;
for(int i=0;i<n;i++){
if(s[i]>0)v[s[i]].push(i);
if(s[i]<0)vv[-s[i]].push(i);
}
for(int i=0;i<n;i++){
if(vis[i])continue;
vis[i]=1;
if(s[i]<0){
int j=v[-s[i]].top();v[-s[i]].pop();
int x=i+qr(i+1),y=j+qr(j+1);
ans+=x+y-1;vis[j]=1;
add(min(i,j)+1,-1);add(max(i,j)+2,-1);
}
else {
int j=vv[s[i]].top();vv[s[i]].pop();
int x=i+qr(i+1),y=j+qr(j+1);
ans+=x+y;vis[j]=1;
add(min(i,j)+1,-1);add(max(i,j)+2,-1);
}
}return ans;
}
