#include <fstream>
#include <iostream>
#include <algorithm>
#include <string.h>

using namespace std;

const int MAX_N = 2 * 1e3;
const long long MOD = (1LL << 32);
pair<int, int> a[MAX_N + 1];
unsigned int dp[MAX_N + 1], ind[MAX_N + 1], sum[MAX_N + 1];
unsigned int aib[MAX_N + 1][MAX_N + 1];
int n;

void addSelf(unsigned int &x, unsigned int y) {
    long long aux = x + y;
    if (aux >= MOD) {
        aux -= MOD;
    }
    x = aux;
}

void update(long long x, long long y, long long val) {
    for (int i = y; i <= MAX_N; i += i & -i) {
        addSelf(aib[x][i], val);
    }
}

long long query(long long x, long long y) {
    unsigned int answer = 0;
    for (int i = y; i >= 1; i -= i & -i) {
        addSelf(answer, aib[x][i]);
    }
    return answer;
}

signed main() {
    ifstream fin("psir.in");
    ofstream fout("psir.out");
    fin >> n;
    for (int i = 1; i <= n; i++) {
        fin >> a[i].first;
        a[i].second = i;
    }
    sort(a + 1, a + n + 1);
    int cnt = 2;
    ind[a[1].second] = 2;
    for (int i = 2; i <= n; i++) {
        if (a[i].first != a[i - 1].first) {
            cnt++;
        }
        ind[a[i].second] = cnt;
    }
    for (int i = 1; i <= n; i++) {
        memset(dp, 0, sizeof(dp));
        for (int j = 1; j < i; j++) {
            dp[ind[j]]++;
        }
        for (int j = 2; j < i; j++) {
            if (ind[j] > ind[i]) {
                long long tmp = query(j, ind[i] - 1);
                addSelf(dp[ind[j]], tmp);
            } else if (ind[j] < ind[i]) {
                long long tmp = (sum[j] - query(j, ind[i]) + MOD) % MOD;
                addSelf(dp[ind[j]], tmp);
            }
        }
        for (int j = 1; j <= n + 1; j++) {
            if (dp[j] > 0) {
               update(i, j, dp[j]);
            }
            addSelf(sum[i], dp[j]);
        }
    }
    unsigned int answer = 0;
    for (int i = 1; i <= n; i++) {
        addSelf(answer, sum[i]);
    }
    fout << answer;
    return 0;
}