//file_name:ABC77_C.cpp
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() { int x; scanf("%d",&x); return x;}
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const v(T)&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>inline ostream& operator<<(ostream&o,const v(T)&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
template<typename T>inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return 0;}
#define yn {puts("Yes");}else{puts("No");}
const int MX = 200005;

    // int scan
    /*
    int x;
    scanf("%d",&x);
    int y;
    scanf("%d",&y);
    int z;
    scanf("%d",&z);

    // matrix scan
    /*
    ll a[n] = {};
    rep(i,n){
        scanf("%lld",&a[i]);
    }
    */

    // string scan
    /*
    string s;
    cin >> s;
    */


int main() {
    int n;
    scanf("%d",&n);
    ll a[n] = {};
    rep(i,n){
        scanf("%lld",&a[i]);
    }
    ll b[n] = {};
    rep(i,n){
        scanf("%lld",&b[i]);
    }
    ll c[n] = {};
    rep(i,n){
        scanf("%lld",&c[i]);
    }
    sort(a,a+n);
    sort(b,b+n);
    sort(c,c+n);
    /*
    rep(i,n){
        cout << a[i] << ' ';
    }
    cout << endl;
    rep(i,n){
        cout << b[i] << ' ';
    }
    cout << endl;
    rep(i,n){
        cout << c[i] << ' ';
    }
    cout << endl;
    */

    // n==1
    if(n==1){
        int ans = 0;
        if(a[0]<b[0]&&b[0]<c[0])ans++;
        cout << ans << endl;
        return 0;
    }

    ll ans = 0;

    // b固定
    ll counta = 0;
    ll countc = n-1;
    while(true){
        int flagc = 0;
        if(0<countc){
            if(c[countc-1]>b[0]){
                countc--;
                flagc = 1;
            }
        }
        if(flagc==0)break;
    }
    rep(i,n){
        while(true){
            int flaga = 0;
            if(counta<n-1){
                if(a[counta+1]<b[i]){
                    counta++;
                    flaga = 1;
                }
            }
            if(flaga==0)break;
        }
        while(true){
            int flagc = 0;
            if(c[countc]<=b[i]&&countc<n-1){
                countc++;
                flagc = 1;
            }
            if(flagc==0)break;
        }
        if(a[counta]>=b[i] || c[countc]<=b[i]){
            continue;
        }else{
            ans += (counta+1)*(n-countc);
        }
    }


    

    cout << ans << endl;
    return 0;
}



Measured memory_bytes: 2560