//Code by Patcas Csaba

#include <vector>
#include <string> 
#include <set> 
#include <map> 
#include <queue> 
#include <bitset> 
#include <stack>
#include <list>

#include <numeric> 
#include <algorithm> 

#include <cstdio>
#include <fstream>
#include <iostream> 
#include <sstream> 
#include <iomanip>

#include <cctype>
#include <cmath> 
#include <ctime>
#include <cassert>

using namespace std;

#define LL long long
#define PII pair <int, int>
#define VB vector <bool>
#define VI vector <int>
#define VD vector <double>
#define VS vector <string>
#define VPII vector <pair <int, int> >
#define VVI vector < VI >
#define VVB vector < VB >

#define FORN(i, n) for(int i = 0; i < (n); ++i)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define REPEAT do{ 
#define UNTIL(x) }while(!(x)); 

#define SZ size()
#define BG begin() 
#define EN end() 
#define CL clear()
#define X first
#define Y second
#define RS resize
#define PB push_back
#define MP make_pair
#define ALL(x) x.begin(), x.end()

#define IN_FILE "a.in"
#define OUT_FILE "a.out"

int n;
VI a, index, sibling;

int main()
{
	//Read data
	//freopen(IN_FILE, "r", stdin);
	//freopen(OUT_FILE, "w", stdout);
	
  cin >> n;
  a.RS(2 * n + 1);
  index.RS(n + 1);
  sibling.RS(2 * n + 1);
  FOR(i, 1, 2 * n)
  {
    cin >> a[i];
    if (index[a[i]] == 0) index[a[i]] = i;
    else
    {
      sibling[i] = index[a[i]];
      sibling[index[a[i]]] = i;
    }
  }

	//Write data
  int ans = 0;
  FOR(i, 1, 2 * n)
    if (i < sibling[i])
      FOR(j, i + 1, sibling[i] - 1)
      {
         if (sibling[j] < i || sibling[j] > sibling[i]) ++ans;
      }
  
  cout << ans / 2;
	return 0;
}