#include <cstdio>
#include <algorithm>
#define lm 2010
using namespace std;

struct poz
{
	int v, p;
} c[lm];

int cmp(poz a, poz b)
{
	return a.v<b.v;
}

int v[lm], n;
unsigned int a[lm][lm];

int search(int s, int d, int l, int x)
{
	int m, r=0;
	while (s<=d)
	{
		m=(s+d)/2;
		if (a[l][m]>x) d=m-1; else 
		{
			s=m+1;
			r=m;
		}
	}
	return r;
}

int main()
{
	freopen("psir.in","r",stdin);
	freopen("psir.out","w",stdout);
	scanf("%d",&n);
	int i, j, p, k;
	for (i=1; i<=n; i++) scanf("%d",&v[i]);
	for (i=2; i<=n; i++)
	{
		for (j=1; j<i; j++)
		{
			c[j].v=v[j];
			c[j].p=j;
		}
		sort(c+1,c+i,cmp);
		for (j=1; j<i; j++) a[i][j]=c[j].v;
		for (j=1; j<i; j++)
		{
			k=c[j].p;
			if (v[i]<v[k])
			{
				p=search(1,k-1,k,v[i]-1);
				if (j==1) a[n-i+1][n-i+1+j]=a[n-k+1][n-k+1+p]+1; else
				a[n-i+1][n-i+1+j]=a[n-i+1][n-i+1+j-1]+a[n-k+1][n-k+1+p]+1;
			} else
			if (v[i]>v[k])
			{
				p=search(1,k-1,k,v[i]);
				if (j==1) a[n-i+1][n-i+1+j]=a[n-k+1][n-k+1+k-1]-a[n-k+1][n-k+1+p]+1; else
				a[n-i+1][n-i+1+j]=a[n-i+1][n-i+1+j-1]+(a[n-k+1][n-k+1+k-1]-a[n-k+1][n-k+1+p])+1;
			} else 
			{
				if (j==1) a[n-i+1][n-i+1+j]=1; else
					a[n-i+1][n-i+1+j]=a[n-i+1][n-i+1+j-1]+1;
			}
		}
	}
	unsigned int r=0;
	for (i=1; i<n; i++) r=r+a[i][n];
	printf("%u",r);
}