#include <bits/stdc++.h>
using namespace std;
const int MAX = (5e5)+1;
int n, start, ans, a[MAX], tmp[MAX], d[MAX], e[MAX];
bool mark[MAX];
multiset<int> st;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for(int i = 0; i < n; i++) cin >> a[i], --a[i];
copy(a, a+n, tmp);
sort(tmp, tmp+n);
int curr = 0;
for(int x: tmp) {
if(mark[x]) curr = (curr+1)%n;
else curr = start = x;
mark[curr] = true;
}
for(int i = 0; i < n; i++) cin >> d[i];
for(int i = 0; i < n; i++) cin >> e[i];
for(int z = 0, i = start; z < n; z++, i = (i+1)%n) {
st.insert(e[i]);
auto it = st.lower_bound(d[i]);
if(it != st.end()) ans++, st.erase(it);
else st.erase(st.begin());
}
cout << ans;
}
