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.*;
import java.util.stream.*;

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);				
			}
		}		
		
		//System.out.println(convertWithStream(minIndexes));
		
		int u, v, w;
		int w_A = -1, v_B = -1, u_C = -1, v_D = -1, w_D = -1, u_E = -1, w_E = -1, u_F = -1, v_F = -1, u_G = -1, v_G = -1, w_G = -1;
		
		for(MinIndex minInd : minIndexes.values()) {
			if(minInd.u_a == n && minInd.v_b == n && minInd.w_c < n ) {
				w_A = Math.max(w_A, minInd.w_c);
			} else
			if(minInd.u_a == n && minInd.v_b < n  && minInd.w_c == n) {
				v_B = Math.max(v_B, minInd.v_b);
			} else
			if(minInd.u_a < n  && minInd.v_b == n && minInd.w_c == n) {
				u_C = Math.max(u_C, minInd.u_a);
			} else
			if(minInd.u_a == n && minInd.v_b < n  && minInd.w_c < n ) {
				v_D = Math.max(v_D, minInd.v_b);
				w_D = Math.max(w_D, minInd.w_c);
			} else
			if(minInd.u_a < n  && minInd.v_b == n && minInd.w_c < n ) {
				u_E = Math.max(u_E, minInd.u_a);
				w_E = Math.max(w_E, minInd.w_c);
			} else
			if(minInd.u_a < n  && minInd.v_b < n  && minInd.w_c == n) {
				u_F = Math.max(u_F, minInd.u_a);
				v_F = Math.max(v_F, minInd.v_b);
			} else 
			if(minInd.u_a < n  && minInd.v_b < n  && minInd.w_c < n ) {
				u_G = Math.max(u_G, minInd.u_a);
				v_G = Math.max(v_G, minInd.v_b);
				w_G = Math.max(w_G, minInd.w_c);
			}
		}		
		
		//System.out.println("w_A = " + w_A + ", v_B = " + v_B + ", u_C = " + u_C);
		//System.out.println("v_D = " + v_D + ", w_D = " + w_D + ", u_E = " + u_E);
		//System.out.println("w_E = " + w_E + ", u_F = " + u_F + ", v_F = " + v_F);
		//System.out.println("u_G = " + u_G + ", v_G = " + v_G + ", w_G = " + w_G);
		
		u = u_C;
		v = v_B;
		w = w_A;
		
		//System.out.println("1) u = " + u + ", v = " + v + ", w = " + w);
		
		Pair vw = new Pair(v, w, v_D, w_D);
		vw.compare();
		v = vw.a;
		w = vw.b;
		
		//System.out.println("2) u = " + u + ", v = " + v + ", w = " + w);
		
		Pair uw = new Pair(u, w, u_E, w_E);
		uw.compare();
		u = uw.a;
		w = uw.b;
		
		//System.out.println("3) u = " + u + ", v = " + v + ", w = " + w);
		
		Pair uv = new Pair(u, v, u_F, v_F);
		uv.compare();
		u = uv.a;
		v = uv.b;
		
		//System.out.println("4) u = " + u + ", v = " + v + ", w = " + w);	
		int max = Math.max(Math.max(u,v),w);
		
		if((u == -1 || u < u_G) && (v == -1 || v < v_G) && (w == -1 || w < w_G)) {
			List<Integer> nums = new ArrayList<>();
			int su = u_G + Math.max(v, 0) + Math.max(w, 0);
			nums.add(su);
			int sv = Math.max(u, 0) + v_G + Math.max(w, 0);
			nums.add(sv);
			int sw = Math.max(u, 0) + Math.max(v, 0) + w_G;
			nums.add(sw);
			
			Collections.sort(nums);
			//System.out.println(Arrays.toString(nums.toArray()));
			if(nums.get(0) == nums.get(2)) {
				int gMin = min(u_G, v_G, w_G);
				if(gMin == u_G) u = u_G; else
				if(gMin == v_G) v = v_G; else
				if(gMin == w_G) w = w_G;
			} else {
				int mNum = nums.get(0);
				if(mNum == su) u = u_G; else
				if(mNum == sv) v = v_G; else
				if(mNum == sw) w = w_G;
			}			
		}
		
		//System.out.println("u = " + u + ", v = " + v + ", w = " + w);
		System.out.println(answ(u) + answ(v) + answ(w));
	}
	
	public static int min(int a, int b, int c) {
		return Math.min(Math.min(a,b),c);
	}
	
	public static int answ(int a) {
		return (a == -1) ? 0 : a+1;
	}
	
	public static String convertWithStream(Map<?, ?> map) {
		String mapAsString = map.keySet().stream()
		  .map(key -> key + "=" + map.get(key))
		  .collect(Collectors.joining(", ", "{", "}"));
		return mapAsString;
	}
}

class Pair {
	int a; // v
	int b; // w
	int a_comp; // v_D
	int b_comp; // w_D
	
	public Pair(int a, int b, int a_comp, int b_comp) {
		this.a = a;
		this.b = b;
		this.a_comp = a_comp;
		this.b_comp = b_comp;
	}
	
	public void compare() {
		if(a_comp == -1 && b_comp == -1) {
			return;
		}
		
		if(a == -1 && b == -1) {
			int min = Math.min(a_comp, b_comp);
			if(min == a_comp) {
				a = a_comp;
			} else {
				b = b_comp;
			}
		} else
		if(a != -1 && b != -1 && a < a_comp && b < b_comp) {
			if(a_comp - a < b_comp - b) {
				a = a_comp;
			} else {
				b = b_comp;
			}
		} else
		if(a == -1 && b != -1 && b_comp > b) {
			if(a_comp != -1 && a_comp < b_comp - b) {
				a = a_comp;
			} else {
				b = b_comp;
			}
		} else
		if(b == -1 && a != -1 && a_comp > a) {
			if(b_comp != -1 && b_comp < a_comp - a) {
				b = b_comp;
			} else {
				a = a_comp;
			}
		} 
	}
}

class MinIndex {
	int u_a;
	int v_b;
	int w_c;
	
	public MinIndex(int n) {
		u_a = n;
		v_b = n;
		w_c = n;
	}
	
	public String toString() {
		return u_a + " " + v_b + " " + w_c;
	}
}