#include "bits/stdc++.h"
using namespace std;
#define all(x) begin(x),end(x)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pi;
const int mxN = 1e5+1, oo = 1e9;
template<typename T> struct fenwick {
    int n;
    vector<T> fen;
    fenwick(){}
    fenwick(int nn) {
        fen.resize(nn+1);
        n = nn;
    }
    auto sum(int i) {
        T ans = 0;
        while(i) {
            ans+=fen[i];
            i&=i-1;
        }
        return ans;
    }
    auto query(int l, int r) {
        return sum(r+1)-sum(l);
    }
    void update(int i, T val) {
        ++i;
        while(i<=n) {
            fen[i]+=val;
            i+= i&(-i);
        }
    }
};
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n; cin >> n;
    vi sec(n,-1);
    vi a(2*n); 
    for(int i=0;i<2*n;++i) {
        cin >> a[i],a[i]--;
        if(sec[a[i]]==-1) sec[a[i]]=i;
    }
    ll ans = n;
    fenwick<int> fen(2*n);
    for(int i=0;i<2*n;++i) {
        auto couple = sec[a[i]];
        if(couple==i) continue;
        ans+= i-couple-1-fen.query(couple+1,i-1);
        fen.update(couple,1);
        fen.update(i,1);
    }
    cout << ans << '\n';
}