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

#include <bits/stdc++.h>
using namespace std;
const int inf = 1000000000;
int n, a[111111], b[111111], c[111111], tot;
int ar[333333] = {0}, br[333333] = {0}, cr[333333] = {0};
inline int rd() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 1) + (x << 3) + (ch ^ 48);
    ch = getchar();
  }
  return x * f;
}
struct item {
  int val, id1, id2;
} ite[300010];
struct Pair {
  int b, c;
};
bool operator<(Pair a, Pair b) { return a.b < b.b; }
set<Pair> s;
set<Pair>::iterator it;
multiset<int> vals;
multiset<int>::iterator valit;
bool cmp(item a, item b) { return a.val < b.val; }
void insertPair(int newb, int newc) {
  int nowb, nowc;
  Pair e = {newb, newc};
  it = s.upper_bound(e);
  if ((*it).c >= e.c) return;
  nowc = (*it).c;
  it--;
  valit = vals.find((*it).b + nowc);
  vals.erase(valit);
  while ((*it).c <= e.c) {
    nowb = (*it).b, nowc = (*it).c;
    it--;
    vals.erase((*it).b + nowc);
    it++;
    s.erase(it);
    it = s.lower_bound(e);
    it--;
  }
  nowb = (*it).b, nowc = (*it).c;
  vals.insert(nowb + e.c);
  it++;
  nowc = (*it).c;
  vals.insert(e.b + nowc);
  s.insert(e);
}
inline void rdin() {
  n = rd();
  for (int i = 1; i <= n; i++) {
    ite[++tot].val = rd();
    ite[tot].id1 = 1;
    ite[tot].id2 = i;
  }
  for (int i = 1; i <= n; i++) {
    ite[++tot].val = rd();
    ite[tot].id1 = 2;
    ite[tot].id2 = i;
  }
  for (int i = 1; i <= n; i++) {
    ite[++tot].val = rd();
    ite[tot].id1 = 3;
    ite[tot].id2 = i;
  }
  sort(ite + 1, ite + 3 * n + 1, cmp);
  tot = 0;
  for (int i = 1; i <= 3 * n; i++) {
    if (i == 1 || ite[i].val != ite[i - 1].val) tot++;
    if (ite[i].id1 == 1) a[ite[i].id2] = tot;
    if (ite[i].id1 == 2) b[ite[i].id2] = tot;
    if (ite[i].id1 == 3) c[ite[i].id2] = tot;
  }
  for (int i = 1; i <= n; i++)
    if (!ar[a[i]]) ar[a[i]] = i;
  for (int i = 1; i <= n; i++)
    if (!br[b[i]]) br[b[i]] = i;
  for (int i = 1; i <= n; i++)
    if (!cr[c[i]]) cr[c[i]] = i;
}
int main() {
  rdin();
  Pair e;
  e.b = 0, e.c = inf + 1;
  s.insert(e);
  e.b = inf + 1, e.c = 0;
  s.insert(e);
  vals.insert(0);
  for (int i = 1; i <= tot; i++)
    if (!ar[i]) insertPair(br[i] ? br[i] : inf, cr[i] ? cr[i] : inf);
  int ans = inf;
  bool flag = 1;
  for (int i = n; i >= 1; i--) {
    ans = min(ans, i + (*vals.begin()));
    if (ar[a[i]] == i) {
      if (!br[a[i]] && !cr[a[i]]) flag = 0;
      break;
      insertPair(br[a[i]] ? br[a[i]] : inf, cr[a[i]] ? cr[a[i]] : inf);
    }
  }
  if (flag) ans = min(ans, (*vals.begin()));
  printf("%d", ans);
  return 0;
}
