//나는 가상 소녀들에게 큰 호감이 있습니다.
#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <chrono>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <deque>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <stdarg.h>
#include <utility>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define ull unisgned long long
#define ld long double
#define all(a) a.begin(), a.end()
#define SORT(a) sort(all(a))
#define pii pair<int, int>
#define tii triple<int, int, int>
#define e 1e-7
#define PI acos(-1)
#define sz(a) (int)(a.size())
#define inf 1e17
#define vi vector<int>
#define F first
#define S second
#define rng(x) for(int _ = 0; _ < (x); _++)
#define rngi(i, x) for(int i = 0; i < (x); i++)
#define rngsi(s, i, x) for(int i = (s); i <(x); i++)
#define problem "a"
template<typename A, typename B, typename C>
struct triple {
A X;
B Y;
C Z;
triple(A a = 0, B b = 0, C c = 0) :X(a), Y(b), Z(c) {}
};
template<typename A, typename B, typename C>
triple<A, B, C> make_triple(A a = 0, B b = 0, C c = 0) {
return triple<A, B, C>(a, b, c);
}
template<typename A, typename B, typename C>
bool operator<(const triple<A, B, C>& a, const triple<A, B, C>& b) {
if (a.X != b.X)
return a.X < b.X;
if (a.Y != b.Y)
return a.Y < b.Y;
return a.Z < b.Z;
}
template<typename T, typename SS>
ostream& operator<<(ostream& ofs, const pair<T, SS>& p) {
ofs << "( " << p.F << " , " << p.S << " )";
return ofs;
}
template<typename T>
void print(T a) {
for (auto i : a)
cout << i << ' ';
cout << '\n';
}
template<typename T>
T max(T a, T b, T c) {
return max(a, max(b, c));
}
template<typename T>
T min(T a, T b, T c) {
return min(a, min(b, c));
}
template<typename T, typename D>
D min(T a) {
return *min_element(all(a));
}
template<typename T, typename D>
D max(T a) {
return *max_element(all(a));
}
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
#include "shoes.h"
struct fw {
vi tree;
int n;
fw(int m) { n = m; tree.resize(n); }
void add(int v, int x) {
for (int r = v; r < n; r = r|(r + 1))tree[r] += x;
};
int get(int l) {
int r = 0; for (int v = l; v >= 0; v = (v & (v + 1)) - 1)r += tree[v]; return r;
}
int sum(int l, int r) {
if (l > r)return 0;
return get(r) - get(l - 1);
}
};
long long count_swaps(std::vector<int> s) {
int n = sz(s) / 2;
vector<deque<int> > pl(n+1), pr(n+1);
rngi(i, 2 * n) if (s[i] < 0) pl[-s[i]].push_back(i); else pr[s[i]].push_back(i);
vi used(2 * n);
ll ans = 0;
fw t(2*n);
int z = 0;
for(int i = 2 * n - 1; i >=0; i--)if(!used[i]){
int x = s[i];
if (x < 0) {
int v = pr[-x].back();
pr[-x].pop_back();
pl[-x].pop_back();
used[v] = 1;
t.add(v, 1);
ans += i - v - t.sum(v+1,i-1);
}
else {
int v = pl[x].back();
used[v] = 1;
pl[x].pop_back();
pr[x].pop_back();
t.add(v, 1);
ans += i - v - 1 - t.sum(v+1,i-1);
}
}
return ans;
}
