#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>

using ll = long long;
const int N = 1e5+10;
int a[N], b[N], c[N];
int as[N], cs[N]; 
int cnt[N], s[N];

using namespace std;

int main()
{
    int n; cin >> n;
    for(int i = 1; i <= n; i ++) cin >> a[i], a[i]++;
    for(int i = 1; i <= n; i ++) cin >> b[i], b[i]++;
    for(int i = 1; i <= n; i ++) cin >> c[i], c[i]++;

    //求as[]
    //统计a的每个元素有几个:cnt[3]—元素为3在a中有几个
    for(int i = 1; i <= n; i ++) cnt[a[i]]++; 
    for(int i = 1; i < N; i ++) s[i] = s[i-1] + cnt[i];//a元素个数的前缀和
    for(int i = 1; i <= n; i ++) as[i] = s[b[i]-1]; //比b[i]元素小的a的个数

    //清空cnt和s数组
    memset(cnt, 0, sizeof cnt);
    memset(s, 0, sizeof s);
    //求cs[]

    for(int i = 1; i <= n; i ++) cnt[c[i]]++;
    for(int i = 1; i < N; i ++) s[i] = s[i-1] + cnt[i];
    for(int i = 1; i <= n; i ++) cs[i] = s[N-1] - s[b[i]]; //比b[i]元素大的c的个数

    ll res = 0;
    for(int i = 1; i <= n; i ++) res += (ll)as[i] * cs[i];
    cout << res;
    return 0;
}