#include "shoes.h"
#include <bits/stdc++.h>

using namespace std;

namespace {

typedef long long ll;

const int N = 1e5 + 7;

int n;
int s[2 * N];
vector<int> ls[N], rs[N];
int f[2 * N];

void add(int i, int x) {
	for (++i; i <= 2 * n; i += i & -i) {
		f[i] += x;
	}
}

int get(int i) {
	int ret = 0;
	for (; i > 0; i -= i & -i) {
		ret += f[i];
	}
	return ret;
}

int get(int l, int r) {
	return get(r) - get(l);
}

}

long long count_swaps(vector<int> grds) {
	n = grds.size() / 2;
	for (int i = 0; i < 2 * n; ++i) {
		s[i] = grds[i];
	}
	for (int i = 0; i < 2 * n; ++i) {
		if (s[i] < 0) {
			ls[-s[i]].push_back(i);
		} else {
			rs[s[i]].push_back(i);
		}
	}
	vector<pair<int, int>> ps;
	ll ans = 0;
	for (int x = 1; x <= n; ++x) {
		for (int i = 0; i < (int)ls[x].size(); ++i) {
			int l = ls[x][i];
			int r = rs[x][i];
			if (l > r) {
				ans += 1;
				swap(l, r);
			}
			ps.push_back({l, r});
		}
	}
	sort(ps.begin(), ps.end(), [&](auto p1, auto p2) {
		return p1.second < p2.second;
	});
	for (auto p : ps) {
		int l = p.first, r = p.second;
		ans += get(l, r);
		add(l, 1);
		add(r, 1);
	}
	return ans;
}