#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcount
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
const int N = 5e5 + 7;
int a[N], p1[N], p2[N];
set <int> add[N];
bool comp(int i, int j) {
return p1[i] > p1[j];
}
signed main() {
#ifdef HOME
freopen("input.txt", "r", stdin);
#else
#define endl '\n'
ios_base::sync_with_stdio(0); cin.tie(0);
#endif
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
for (int i = 1; i <= n; ++i)
cin >> p1[i];
for (int i = 1; i <= n; ++i) {
cin >> p2[i];
add[a[i]].insert(p2[i]);
}
vector <int> per;
for (int i = 1; i <= n; ++i)
per.app(i);
sort(all(per), comp);
int ans = 0;
set <int> can;
for (int i = 1; i <= n; ++i)
if (add[i].size())
can.insert(i);
for (int i : per) {
int j;
{
auto t = can.upper_bound(i);
if (t == can.begin()) {
j = *can.rbegin();
}
else {
j = *prev(t);
}
}
auto t = add[j].upper_bound(p1[i]);
if (t != add[j].end()) {
++ans;
add[j].erase(t);
}
else {
add[j].erase(add[j].begin());
}
if (add[j].empty())
can.erase(j);
}
cout << ans << endl;
}
