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

#ifdef LOCAL
    #define _GLIBCXX_DEBUG
#endif

#include <bits/stdc++.h>
#define int long long
#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 int 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;
int sol;
int v[NMAX];
int aib[NMAX][NMAX];

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

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

    for (int i = 1 ; 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();

    int suma = 0, pos;
    int dp; 
    for (int i = 1 ; i <= N ; ++ i)
    {
        for (int j = i + 1 ; j <= N ; ++ j)
        {
            dp = 1;
            if (v[i] > v[j])
            {
                suma = 0;
                pos = get_norm(v[j]) - 1;
                while (pos)
                {
                    suma += aib[i][pos];
                    if (suma >= MOD) suma -= MOD;
                    pos -= (pos & (-pos));
                }
                dp += suma;
            }
            else
            {
                if (v[i] < v[j])
                {
                    suma = 0;
                    pos = valori.size();
                    while (pos)
                    {
                        suma += aib[i][pos];
                        if (suma >= MOD) suma -= MOD;
                        pos -= (pos & (-pos));
                    }
                    dp += suma;

                    suma = 0;
                    pos = get_norm(v[j]);
                    while (pos)
                    {
                        suma += aib[i][pos];
                        if (suma >= MOD) suma -= MOD;
                        pos -= (pos & (-pos));
                    }
                    dp -= suma;
                }
            }

            if (dp < 0) dp += MOD;
            if (dp >= MOD) dp -= MOD;
            
            sol += dp;
            if (sol >= MOD) sol -= MOD;

            pos = get_norm(v[i]);
            while (pos <= M)
            {
                aib[j][pos] += dp;
                if (aib[j][pos] >= MOD) aib[j][pos] -= MOD;
                pos += (pos & (-pos));
            }
        }
    }
}
///-------------------------------------
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;
}