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 = 1000000;
struct rectangle_set {
  map<int, int> mp;
  multiset<int> st;
  rectangle_set() {
    mp[-1] = INF * 2;
    mp[0] = 0;
    st.insert(0);
  }
  void add(int x, int y) {
    bool upd = false;
    int nexty = INF, nextx = INF;
    while (true) {
      auto itr = mp.lower_bound(x);
      itr--;
      if ((*itr).second > y) {
        break;
      }
      upd = true;
      nextx = min(nextx, (*itr).first);
      nexty = min(nexty, (*itr).second);
      st.erase(st.find((*itr).first + (*itr).second));
      mp.erase(itr);
    }
    if (upd) {
      mp[nextx] = y;
      st.insert(nextx + y);
      mp[x] = nexty;
      st.insert(x + nexty);
    }
  }
  int getmin() { return *st.begin(); }
};
int main() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  vector<int> b(n);
  for (int i = 0; i < n; i++) {
    cin >> b[i];
  }
  vector<int> c(n);
  for (int i = 0; i < n; i++) {
    cin >> c[i];
  }
  vector<int> x;
  for (int i = 0; i < n; i++) {
    x.push_back(a[i]);
    x.push_back(b[i]);
    x.push_back(c[i]);
  }
  sort(x.begin(), x.end());
  x.erase(unique(x.begin(), x.end()), x.end());
  int m = x.size();
  for (int i = 0; i < n; i++) {
    a[i] = lower_bound(x.begin(), x.end(), a[i]) - x.begin();
    b[i] = lower_bound(x.begin(), x.end(), b[i]) - x.begin();
    c[i] = lower_bound(x.begin(), x.end(), c[i]) - x.begin();
  }
  vector<int> ap(m, INF), bp(m, INF), cp(m, INF);
  for (int i = n - 1; i >= 0; i--) {
    ap[a[i]] = i;
    bp[b[i]] = i;
    cp[c[i]] = i;
  }
  rectangle_set st;
  for (int i = 0; i < m; i++) {
    if (ap[i] == INF) {
      st.add(bp[i] + 1, cp[i] + 1);
    }
  }
  int ans = st.getmin() + n;
  for (int i = n - 1; i >= 0; i--) {
    if (ap[a[i]] == i) {
      st.add(bp[a[i]] + 1, cp[a[i]] + 1);
    }
    ans = min(ans, st.getmin() + i);
  }
  cout << ans << endl;
}
