#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "shoes.h"
#include<bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define pb push_back
using namespace std;
using namespace __gnu_pbds;
template<typename T>
using ordered_set=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
map<ll,vector<ll>> mp;
map<ll,ll> mp1;
long long count_swaps(vector<int> a) {
ll n=a.size();
ordered_set<ll> s;
vector<bool> vis(n,false);
ll ans=0;
for(ll i=0; i<n; i++) {
mp[a[i]].push_back(i);
mp1[a[i]]=0;
}
for(ll i=0; i<n; i++) {
if(vis[i]) {
continue;
}
ll x=a[i],y=-1*a[i];
ll z=mp[y][mp1[y]],j=i;
vis[z]=true;
ll z1=z;
auto it=s.upper_bound(i);
if(it!=s.end()) {
j+=s.size()-s.order_of_key(*it);
}
auto it1=s.upper_bound(z);
if(it1!=s.end()) {
z+=s.size()-s.order_of_key(*it1);
}
ans+=(z-j-1);
if(x>0) {
ans++;
}
s.insert(i);
s.insert(z1);
mp1[x]++;
mp1[y]++;
}
return ans;
}
