#include <iostream>
#include <math.h>
using namespace std;

int main(){
	int in;
	while(1){
		cin >> in;
		if(in==0) break;
		int pole1[in];
		int pole2[in];
		int pole3[in];
		int pole2inv[in];
		int pole3inv[in];
		int count = 0;
		int found = 0;
		for(int i=0;i<in;i++){
			cin >> pole1[i];
		}
		for(int i=0;i<in;i++){
			cin >> pole2[i];
		}
		for(int i=0;i<in;i++){
			cin >> pole3[i];
		}
		for(int i=0;i<in;i++){
			pole2inv[pole2[i]] = i;
			pole3inv[pole3[i]] = i;
		}


		int p1l,p1r,p2l,p2r,p3l,p3r;
		for(int i = 0;i<(in-1);i++){
			for(int j = i+1; j< in;j++){
				p1l=pole1[i];
				p1r=pole1[j];
				p2l = pole2inv[p1l];
				p2r = pole2inv[p1r];
				p3l = pole3inv[p1l];
				p3r = pole3inv[p1r];

				/*for(int k=0;k<in;k++){
					if(pole2[k]==p1l) {
						p2l=k;
						found++;
					}
					if(pole2[k]==p1r){ 
						p2r=k;
						found++;
					}

					if(pole3[k]==p1l){
						p3l=k;
						found++;
					}

					if(pole3[k]==p1r){
						p3r=k;
						found++;
					}
					if(found==4){ break;}
					
					// optimalizovat !!!!!!!!!!!!!!!!!
				}*/
				//found = 0;
				if(p2l<p2r & p3l<p3r) {
					count++; 
					//cout << p1l << p1r<<p2l<<p2r<<p3l<<p3r<<endl;
				}

			}
		}
		cout << count << endl;
	}
	return 0;
}