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

public class difficult {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int cols,count;
        int[][] pole;
        
        while(sc.hasNext()){
            cols = sc.nextInt();
            if(cols==0) break;
            
            pole = new int[3][cols];
            for(int o=0; o<3; o++) {
                for(int p=0; p<cols; p++) {
                    pole[o][p] = sc.nextInt();
                }
            }
            
            count = 0;
            
            for(int i=0; i<cols; i++) {
                for(int k=i+1; k<cols; k++) {
                    //mam dvojici, ted ji hledam dal
                    for(int m=0; m<cols; m++) {
                        if(pole[1][m] == pole[0][i]) {
                            for(int n=0; n<cols; n++) {
                                if(pole[2][n] == pole[0][i]) {
                                    count++;
                                    break;
                                }
                                if(pole[2][n] == pole[0][k]) {
                                    break;
                                }
                            }
                            break;
                        }
                        if(pole[1][m] == pole[0][k]) {
                            break;
                        }
                    }
                }
            }
            
            System.out.print(count + "\n");
        }
    }
}