import java.util.Scanner;

public class difficult {
	
	public static void main (String [] args) {
		int nums;
		int []numsPole;
		boolean []locks;
		Scanner sc = new Scanner(System.in);
		boolean [][] pole;
		int tmp;
		while (true) {
			nums = sc.nextInt();
			if (nums == 0) {
				return;
			}
			numsPole = new int[nums];
			locks = new boolean[nums];
			pole = new boolean[nums][nums];
			for (int i = 0; i < nums; i++) {
				pole[i][i] = true;
			}
			for (int user = 0; user < 3; user++) {
				for (int num = 0; num < nums; num++) {
					//System.out.println ("ahoj");
					tmp = sc.nextInt();
					//System.out.println (tmp);
					tmp --;
					locks[tmp] = true;
					for (int i = 0; i < nums; i++) {
						if (!locks[i]) {
							pole[tmp][i] = true;
						}
					}
				}
				for (int i = 0; i < nums; i++) {
					locks[i] = false;
				}
			}
			Double result = 0.0;
			for (int i = 0; i < nums; i++ ) {
				for (int j = 0;  j < nums; j++) {
					if (!pole[i][j]) result++;
				}				
			}			
			System.out.println(result.toString().substring(0, result.toString().indexOf(".")));
			
		}
	}

}