#include "shoes.h"
#include<bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define debug(x) {cerr<<#x<<"="<<x<<"\n";}
#define debug2(x, y) {cerr<<"{"<<#x<<", "<<#y<<"}={"<<x<<", "<<y<<"}\n";}
#define debugp(p) {cerr<<#p<<"={"<<p.first<<", "<<p.second<<"}\n";}
#define debugv(abcd) {cerr<<#abcd<<": ";for (auto dcba:abcd) cerr<<dcba<<", ";cerr<<"\n";}
#define pb push_back
#define SZ(x) ((int)x.size())
#define all(x) x.begin(), x.end()
const int inf=1000001000; // 1e9
const ll INF=10000000010000000; // 1e16
const int mod=1000000007;
const int MAXN=200010, LOG=19;
ll ans; // :(
int n, m, k;
int A[MAXN];
vector<int> vec[MAXN];
ll count_swaps(vector<int> S){
n=SZ(S);
for (int i=0; i<n; i++){
int x=S[i], y=1;
if (x<0) x=-x, y=-1;
if (vec[x].size() && S[vec[x].back()]*y<0){
A[i]=A[vec[x].back()]=m++;
vec[x].pop_back();
}
else vec[x].pb(i);
}
for (int i=0; i<n; i++) A[i]=2*A[i]+(S[i]>0);
for (int i=0; i<n; i++) for (int j=0; j<i; j++) ans+=(A[j]>A[i]);
return ans;
}
