#include <stdio.h>
#include <assert.h>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

#define MAXN 100000

int C[MAXN], m=0;

int compare (const void * a, const void * b)
{
  return ( *(int*)a - *(int*)b );
}

int pausa(int N, int A[], int B[]) {
    int caffe=0, persone=0, fine=0;
    for (int i=0; i<=m; i++){
        for(int s=0; s<N; s++){
            if (B[s]==C[i]){
                persone--;
            }
        }
        for(int s=0; s<N; s++){
            if (A[s]==C[i]){
                persone++;
                caffe+=persone;
            }
        }
    }
    return caffe;
}

int A[MAXN], B[MAXN];

int main() {
    FILE *fr, *fw;
    int N, i;

    fr = fopen("input.txt", "r");
    fw = fopen("output.txt", "w");
    assert(1 == fscanf(fr, "%d", &N));
    for(i=0; i<N; i++){
        assert(2 == fscanf(fr, "%d %d", &A[i], &B[i]));
        C[m]=A[i];
        m++;
        C[m]=B[i];
        m++;
    }
    qsort(C, m, sizeof(int), compare);
    fprintf(fw, "%d\n", pausa(N, A, B));
    fclose(fr);
    fclose(fw);
    return 0;
}