import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.NoSuchElementException;

public class Main {
    public static void main(String[] args) {
        Main main = new Main();
        main.solve();
        main.out.close();
    }
    // ======================================================================
    public void solve() {
    	int N = ni();
    	int[] A = ni(N);
    	int[] B = ni(N);
    	int[] C = ni(N);
    	Arrays.sort(A);
    	Arrays.sort(C);
    	long ans = 0;
    	long indexA, indexC;
    	for (int i = 0; i < N; i++) {
    		indexA = lower(A, B[i]);
    		indexC = upper(C, B[i]);
    		ans += (indexA * (N - indexC));
//    		out.println("indexA = " + indexA + "  indexC = " + indexC + " ans = " + ans);
		}
    	out.println(ans);
    }
    int upper(int[] A, int key) {		// より大きい
    	int ng, ok, mid;
		ng = -1;	ok = A.length;
		while(ok - ng > 1) {
			mid = (ok + ng) / 2;
//			out.println(" 1  ng = " + ng + "  ok = " + ok + "  mid = " + mid
//					+ "  A[" + mid + "] = " + A[mid] + "  >  key = " + key);
			if(A[mid] > key)	ok = mid;
			else				ng = mid;
		}
		return ok;
    }
    int lower(int[] A, int key) {		// 以上
    	int ng, ok, mid;
		ng = -1;	ok = A.length;
		while(ok - ng > 1) {
			mid = (ok + ng) / 2;
//			out.println(" 2  ng = " + ng + "  ok = " + ok + "  mid = " + mid
//					+ "  A[" + mid + "] = " + A[mid] + "  >=  key = " + key);
			if(A[mid] >= key)	ok = mid;
			else				ng = mid;
		}
		return ok;
    }
    // ------------------------------------------
    // ライブラリ
    // ------------------------------------------
    // Print
	private PrintWriter out = new PrintWriter(System.out);

    // Scanner
    private FastScanner scan = new FastScanner();
    int ni(){ return scan.nextInt();}
    int[] ni(int n){int[] a = new int[n]; for(int i = 0; i < n; i++){a[i] = ni();} return a;}
    int[][] ni(int y, int x){int[][] a = new int[y][x];
        for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ni();}} return a;}
    long nl(){return scan.nextLong();}
    long[] nl(int n){long[] a = new long[n]; for(int i = 0; i < n; i++){a[i] = nl();} return a;}
    long[][] nl(int y, int x){long[][] a = new long[y][x];
        for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = nl();}} return a;}
    String ns(){return scan.next();}
    String[] ns(int n){String[] a = new String[n]; for(int i = 0; i < n; i++){a[i] = ns();} return a;}
    String[][] ns(int y, int x){String[][] a = new String[y][x];
        for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ns();}} return a;}
}
class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
    private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    public double nextDouble() { return Double.parseDouble(next());}
}


Measured memory_bytes: 34092