import java.io.*;
import java.util.*;

public class difficult{
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		long res;
		int N; 
		int[] a,b,c;
		while(true){
			res=0;
			N = sc.nextInt();
			if(N==0)break;
			
			a = new int[N];
			b = new int[N];
			c = new int[N];
			
			for(int i=0; i<N; i++){a[sc.nextInt()-1]=i;}
			for(int i=0; i<N; i++){b[sc.nextInt()-1]=i;}
			for(int i=0; i<N; i++){c[sc.nextInt()-1]=i;}
			
			for(int i=0; i<N; i++){
				for(int j=i+1; j<N; j++){
					if( ((a[i]<a[j]) && (b[i]<b[j]) && (c[i]<c[j])) ||
						((a[i]>a[j]) && (b[i]>b[j]) && (c[i]>c[j])) ){
						res++;
					}
				}
			}
			
			System.out.println(res);
		}
	}
}