#include <iostream>
#include <cstdlib>
#include <vector>
#include <stdio.h>
#include<algorithm>


using namespace std;

#define MAX 150000

int main()
{
	
	int N;
	int member1[MAX];
	int member2[MAX];
	int member3[MAX];
	
	while (1) {
		scanf("%d", &N);
		if (N == 0) break;
		
		long long counter = 0;
		
		int t;
		
		for(int i  = 0 ; i < N; i++) {
			scanf("%d", &member1[i]);
		}
		
		for(int i  = 0 ; i < N; i++) {
			scanf("%d", &member2[i]);
		}
		
		for(int i  = 0 ; i < N; i++) {
			scanf("%d", &member3[i]);
		}
		
		for(int i = 0; i < N; i++) {
			int t1; int t2;
			
			for(int j = i + 1; j < N; j++) {
				
				t1 = member1[i]; 
				t2 = member1[j];
				
				int *it1;
				int *it2;
				
				it1 = find(member2, &(member2[N]), t1);
				it2 = find(member2, &(member2[N]), t2);
				
				if(it1 > it2) continue;
				
				it1 = find(member3, &(member3[N]), t1);
				it2 = find(member3, &(member3[N]), t2);
				
				if(it1 > it2) continue;
				
				counter++;
			}
		}
		printf("%lld\n", counter);
	}
	return 0;
}