#ifndef LOCAL
    #pragma GCC optimize("O3")
    #pragma GCC target("avx2")
#endif

#ifdef LOCAL
    #define _GLIBCXX_DEBUG
#endif

#include <bits/stdc++.h>
#define pb push_back
#define pii pair<int, int>
using ll = long long;
using ci = const int;
using cll = const long long;

using namespace std;

const ll MOD = (1LL << 32);
const int NMAX = 2e3 + 5;
/*******************************/
// INPUT / OUTPUT

#ifndef LOCAL
    ifstream in("psir.in");
    ofstream out("psir.out");
    #define cin in
    #define cout out
#endif
/*******************************/
/// GLOBAL DECLARATIONS

int N, M;
ll sol;
int v[NMAX];

inline int aduna(int a, int b)
{
    ll suma = 1LL * a + 1LL * b;
    if (suma >= MOD) suma -= MOD;
    return suma;
}

inline int diff(int a, int b)
{
    ll diff = 1LL * a - 1LL * b;
    if (diff < 0) diff += MOD;
    return diff;
}

struct AIB
{
    int n;
    vector <int> data;

    AIB(){}

    AIB(int _n)
    {
        n = _n;
        data.resize(n + 1, 0);
    }

    inline void update(int pos, int val)
    {
        while (pos <= n)
        {
            data[pos] = aduna(data[pos], val);
            pos += (pos & (-pos));
        }
    }

    inline int query(int pos)
    {
        int suma = 0;
        while (pos)
        {
            suma = aduna(suma, data[pos]);
            pos -= (pos & (-pos));
        }

        return suma;
    }
};

vector <int> valori;
vector <AIB> aib;
/*******************************/
/// FUNCTIONS

void ReadInput();
void Solution();
void Output();
/*******************************/
///-------------------------------------
inline void ReadInput()
{
    cin >> N;

    for (int i = 0 ; i < N ; ++ i)
    {
        cin >> v[i];
        valori.push_back(v[i]);
    }
}
///-------------------------------------
inline int get_norm(int x)
{
    return lower_bound(valori.begin(), valori.end(), x) - valori.begin() + 1;
}
///-------------------------------------
inline void Solution()
{
    sort(valori.begin(), valori.end());
    valori.erase(unique(valori.begin(), valori.end()), valori.end());

    M = valori.size();
    aib.resize(N);
    for (int i = 0 ; i < N ; ++ i)
        aib[i] = AIB(M);

    int dp;
    for (int i = 0 ; i < N ; ++ i)
    {
        for (int j = i + 1 ; j < N ; ++ j)
        {
            dp = 1;
            if (v[i] > v[j])
                dp = aduna(dp, aib[i].query(get_norm(v[j]) - 1));
            else
                if (v[i] < v[j])
                    dp = aduna(dp, diff(aib[i].query(valori.size()), aib[i].query(get_norm(v[j]))));
            
            sol += 1LL * dp;
            if (sol >= MOD) sol -= MOD;

            aib[j].update(get_norm(v[i]), dp);
        }
    }
}
///-------------------------------------
inline void Output()
{
    cout << sol;
}
///-------------------------------------
signed main()
{
    #ifndef LOCAL
        ios::sync_with_stdio(false);
        cin.tie(NULL);
        cout.tie(NULL);
    #endif
    ReadInput();
    Solution();
    Output();
    return 0;
}