There are three arrays a, b and c. Each of them consists of n integers. SmallY wants to find three integers u, v, w (0 ≤ u, v, w ≤ n) such that the following condition holds: each number that appears in the union of a, b and c, appears either in the first u elements of a, or in the first v elements of b, or in the first w elements of c. Of course, SmallY doesn't want to have huge numbers u, v and w, so she wants sum u + v + w to be as small as possible.

Please, help her to find the minimal possible sum of u + v + w.

Input

The first line contains a single integer n (1 ≤ n ≤ 105). The second line contains n space-separated integers a1, a2, ..., an — array a. The third line contains the description of array b in the same format. The fourth line contains the description of array c in the same format. The following constraint holds: 1 ≤ ai, bi, ci ≤ 109.

Output

Print a single integer — the minimum possible sum of u + v + w.

Examples

Input

3
1 1 101
1 2 1
3 2 1


Output

5

Input

5
1 1 2 2 3
2 2 4 3 3
3 3 1 1 1


Output

5

Note

In the first example you should choose u = 3, v = 0, w = 2. 

In the second example you should choose u = 1, v = 3, w = 1.
1
2
3
2
 8
190409007 190409007 352375776 190409007 352375776 352375776 352375776 352375776
190409007 190409007 190409007 190409007 190409007 352375776 352375776 190409007
190409007 352375776 352375776 190409007 190409007 190409007 352375776 352375776
 1
1
1
1
 1
377489979
588153796
588153796
 2
1 1
2 2
3 3
 4
1 1 1 1
1 1 1 1
1 1 1 1
 2
1 2
2 2
1 1
 3
1 1 2
1 1 3
1 1 4

2
 2
 1
 2
 3
 1
 2
 9

import java.util.*;

public class Solution2 {
	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		int n = s.nextInt();
		
		Map<Integer, MinIndex> minIndexes = new HashMap<>();
		for(int j = 0; j < 3; j++) {
			for(int i = 0; i < n; i++) {
				int num = s.nextInt();
				if(!minIndexes.containsKey(num)) {
					minIndexes.put(num, new MinIndex(n));
				}
				MinIndex minInd = minIndexes.get(num);
				if(j == 0) minInd.u_a = Math.min(minInd.u_a, i); else
				if(j == 1) minInd.v_b = Math.min(minInd.v_b, i); else
				if(j == 2) minInd.w_c = Math.min(minInd.w_c, i);				
			}
		}		
		
		int u, v, w;
		int w_A = 0, v_B = 0, u_C = 0, v_D = 0, w_D = 0, u_E = 0, w_E = 0, u_F = 0, v_F = 0;
		
		for(MinIndex minInd : minIndexes.values()) {
			if(minInd.u_a == n && minInd.v_b == n) {
				w_A = Math.max(w_A, minInd.w_c);
			} else
			if(minInd.u_a == n && minInd.w_c == n) {
				v_B = Math.max(v_B, minInd.v_b);
			} else
			if(minInd.v_b == n && minInd.w_c == n) {
				u_C = Math.max(u_C, minInd.u_a);
			} else
			if(minInd.u_a == n) {
				v_D = Math.max(v_D, minInd.v_b);
				w_D = Math.max(w_D, minInd.w_c);
			} else
			if(minInd.v_b == n) {
				u_E = Math.max(u_E, minInd.u_a);
				w_E = Math.max(w_E, minInd.w_c);
			} else
			if(minInd.w_c == n) {
				u_F = Math.max(u_F, minInd.u_a);
				v_F = Math.max(v_F, minInd.v_b);
			}
		}		
		
		u = u_C;
		v = v_B;
		w = w_A;
		
		if(v_D > v && w_D > w) {
			v = v_D;
			w = w_D;
		}
		if(u_E > u && w_E > w) {
			u = u_E;
			w = w_E;
		}
		if(u_F > u && v_F > v) {
			u = u_F;
			v = v_F;
		}
		System.out.println(u+v+w);
	}
}

class MinIndex {
	int u_a;
	int v_b;
	int w_c;
	
	public MinIndex(int n) {
		u_a = n;
		v_b = n;
		w_c = n;
	}
}