#include "shoes.h"
#include <cstdio>
#include <cassert>
#include <bits/stdc++.h>
using namespace std;
//#include "shoes.h"
long long MAXVAL;
const int N=2e5+5;
int tree[4*N];
void update(int idx,int val){
while(idx<=MAXVAL){
tree[idx]+=val;
idx+=(idx&(-idx));
}
}
int read(int idx){
int sum=0;
while(idx>0){
sum+=tree[idx];
idx=idx-(idx&(-idx));
}
return sum;
}
long long count_swaps(vector<int> s) {
long long n=s.size()/2;
long long bati[2*n+1];
MAXVAL=2*n+1;
map<int,queue<int>>mp;
int ka=0;
if(s[0]>0)ka=1;
for(int i=1; i<=2*n; i++){
bati[i]=s[i-1];
mp[bati[i]].push(i);
}
if(n==1){
if(s[0]<0 && s[1]>0){
return 0;
}
else return 1;
}
long long cnt=0;
for(int i=0; i<n; i++){
if(!(abs(s[i])==s[i+n] && s[i]<0)){
cnt=1;
break;
}
}
if(cnt==0){
return (n*(n-1)/2);
}
int c[2*n+1];
fill(c,c+2*n+1,0);
long long ans=0;
vector<pair<int,int>>v;
for(int i=1; i<=2*n; i++){
if(c[i]==1)continue;
int f=i;
int ss=mp[-bati[i]].front();
mp[bati[i]].pop();
mp[-bati[i]].pop();
c[f]=1;
c[ss]=1;
v.push_back({f,ss});
}
for(int i=0; i<n; i++){
int a=v[i].first;
int b=v[i].second;
int aa=read(a)+a;
int bb=read(b)+b;
int ans1=abs(aa-bb)-1;
if(bati[a]<0 && b<a){
ans1++;
}
if(bati[a]>0 && a<b){
ans1++;
}
ans+=ans1;
}
return ans;
}
