#include<bits/stdc++.h>
#define irep(i,l,r) for(int i = l; i <= r; ++i)
#define drep(i,r,l) for(int i = r; i >= l; --i)
#define ceil(pp,qq) (((pp)>0)^((qq)>0)?-Abs(pp)/Abs(qq):(pp)%(qq)?(pp)/(qq)+1:(pp)/(qq))
#define floor(pp,qq) (((pp)>0)^((qq)>0)?-ceil(abs(pp),abs(qq)):(pp)/(qq))
#define ll long long
using namespace std;
ll Abs(ll x){return x > 0 ? x : - x;}
inline ll read(){
	char ch = getchar();
	ll s = 0; bool w = 0;
	while(!isdigit(ch)){if(ch == '-')w = 1;ch = getchar();}
	while(isdigit(ch))s = (s << 3) + (s << 1) + (ch ^ 48), ch = getchar();
	return w ? - s : s;
}

const int itinf = 2e9;
const ll llinf = 4e18;
const int mod = 1000000007;
const int N = 2007;
int p[N], ord[N];
ll f[N], g[N][N], fr[N] = {1};

struct BIT{
	int n;
	vector<ll>t;
	BIT(){}
	BIT(int nn){
		n = nn;
		t.resize(n + 1);
	}
	void insert(int x,int val){
		for(;x <= n; x += (x & -x)){
			t[x] = (t[x] + val) % mod;
		}
	}
	ll query(int x){
		ll ans = 0;
		for(; x; x -= (x & -x))ans += t[x], t[x] %= mod;
		return ans;
	}
	ll ask(int x){
		return query(x) - query(x - 1);
	}
	void clear(){
		irep(i,0,n)t[i] = 0;
	}
};
BIT t[N];

ll qpow(ll base, ll b){
	ll ans = 1;
	while(b){
		if(b & 1)ans *= base, ans %= mod;
		base *= base, base %= mod, b >>= 1;
	}
	return ans;
}

int main(){
	int n = read();
	ll ans = 0;
	for(int i = 1; i <= n; ++i){
		p[i] = read();
		ord[p[i]] = i;
		t[i].t.resize(n + 1);
		t[i].n = n;
		fr[i] = 1ll * fr[i - 1] * i % mod;
	}
	for(int j = 1; j <= n; ++ j){
		int x = ord[j];
		for(int i = 1; i <= n; ++ i){
			if(i == 1)t[i].insert(x, 1);
			else t[i].insert(x, t[i - 1].query(x - 1));
		}
	}
	for(int i = 1; i <= n; ++i)f[i] = t[i].query(n);
	g[0][0] = 1;
	for(int i = 1; i <= n; ++i){
		for(int j = 1; j <= i; ++ j){
			g[i][j] = g[i - 1][j] * j % mod  + g[i - 1][j - 1];
			g[i][j] %= mod;
		}
	}
	for(int i = 1; i <= n; ++ i){
		ans += fr[i] * g[n][i] % mod * f[i] % mod;
		ans %= mod;
	}
	printf("%lld",ans % mod);
	return 0;
}