#include <iostream>
#include <algorithm>
using namespace std;
const int N = 1e5+10;
int a[N], b[N], c[N];
int n;
long long res;
int main() {
    ios:: sync_with_stdio (false);
    cin.tie(0);
    cin >> n;
    for (int i = 0; i < n; i++) cin >> a[i];
    sort(a, a + n);  
    for (int i = 0; i < n; i++) cin >> b[i];

    for (int i = 0; i < n; i++) cin >> c[i];
    sort(c, c + n);  

    res = 0;

    for (int i = 0; i < n; i++) {
        int x = b[i];
        int l = lower_bound(a, a + n, x) - a;
        int r_pos = upper_bound(c, c + n, x) - c;
        int r = n - r_pos;
        res += (long long)l * r; 
    }

    cout << res << endl;
    return 0;
}