#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <utility>
#include <stack>
#include <stack>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <list>

#define FILL(a,b) fill(a,a+(sizeof(a)/sizeof(a[0])),b)
#define FOR(a,b,c) for(int a=b; a<=c; a++)
#define DOWNFOR(a,b,c) for(int a=b; a>=c; a--)
#define SIZEOF(a) (sizeof(a)/sizeof(a[0]))
#define FORARR(i,a) for(unsigned i=0; i<SIZEOF(a); i++)
#define FOREACH(a,b) for(__typeof((b).begin()) a=(b).begin(); a!=(b).end(); a++)
#define GETI(a) scanf("%d", &a)

using namespace std;

long long countmerge(int* a,int s,int e){
//  cout<<"countmerge"<< s << " " <<e<< endl;
  if(e<=s){
    return 0;
  }
  if(e==s+1){
    if (a[s]>a[e]){
      int x = a[s];
      a[s]=a[e];
      a[e]=x;
      return 1;
    } else{
      return 0;
    } 
  }
  int half = (s+e)/2;
  long long result = countmerge(a, s, half) + countmerge(a,half+1,e);
  int* sorted = new int[e-s+1];
  //int sorted[150010];
  int posa=s, posb=half+1;
  FOR(i,0,e-s){
    if((a[posa]>a[posb] || posa > half) && posb<=e){ //pridavame z 2     
      sorted[i]=a[posb++];
      //cout << "z2" << endl;
      //cout << "plus " <<half-posa+1;
      result += (long long)(half-posa+1);
    }else{ // z 1.
      //cout << "z1" << endl;
      sorted[i]=a[posa++];
    }
  }
  FOR(i,0,e-s)
    a[i+s]=sorted[i];
//   cout<<result<<endl; 
  delete[] sorted;
  return result;  
}


long long countinv(int* a,int* b,int n){
       int ainv[150010];
       FOR(i,1,n)
	  ainv[a[i]] = i;
       int bainv[150010];
       FOR(i,1,n)
	  bainv[i] = ainv[b[i]];
      return countmerge(bainv,1,n);
}

int main(void){
  
    int n;
    
    while((cin>>n) && n){
      int a[150010],b[150010],c[150010];
      FOR(i,1,n){
       cin >> a[i];       
      }
      FOR(i,1,n){
       cin >> b[i];       
      }
      FOR(i,1,n)
       cin >> c[i];
      long long inversions=0;
      inversions += countinv(a,b,n);
     // cout << inversions;
      inversions += countinv(a,c,n);
      //cout << inversions;
      inversions += countinv(b,c,n);
      //cout << inversions;
      //cout << (inversions/2)<<endl;

      long long nn=(long long)n;
      
      cout << (nn*(nn-1)-inversions)/2 << endl;
    }
    
  
    return 0;
}