#include <bits/stdc++.h>
using namespace std;

ifstream fin("psir.in");
ofstream fout("psir.out");

unsigned int f[2005][2005];
int n, v[2005];
map <int, int> M;
const long long mod = pow(2, 32);
int l, r, m, pos;

int main()
{
    fin >> n;

    for (int i = 1; i <= n; i++)
        fin >> v[i], M[v[i]];

    int k = 0;
    for (auto& i : M)
        i.second = ++k;

    for (int i = 1; i <= n; i++)
        v[i] = M[v[i]];

    unsigned int res = 0;

    for (int i = 1; i <= n; i++)
    {
        fin >> v[i];

        for (int j = 1; j < i; j++)
        {
            if (v[j] < v[i])
                f[i][v[j]] += f[j][n] - f[j][v[i]] + 1;
            else if (v[j] > v[i])
                f[i][v[j]] += f[j][v[i] - 1] + 1;
        }

        for (int j = 1; j <= n; j++)
            f[i][j] += f[i][j - 1];

        res += f[i][n];
    }

    fout << res;
    
    return 0;
}