#include<bits/stdc++.h>
#define ll long long
#define il inline
#define pn putchar('\n')
#define maxint 2147483647
#define min(x,y) (x<y?x:y)
#define max(x,y) (x>y?x:y)
#define maxn 2005
#define mod 1000000007
#define int ll
using namespace std;
int n,ans;
int a[maxn],b[maxn][maxn],f[maxn],tmp[maxn],jc[maxn];
il void upd(int &x,int y)
{
    x+=y;
    if(x>=mod)
        x-=mod;
    if(x<0)
        x+=mod;
}
il int lowbit(int x)
{
    return x&-x;
}
il void cha(int x,int y,int ad)
{
    for(int i=y;i<=n;i+=lowbit(i))
        upd(b[x][i],ad);
}
il int fi(int x,int y)
{
    int ret=0;
    for(int i=y;i;i-=lowbit(i))
        upd(ret,b[x][i]);
    return ret;
}
signed main()
{
    #ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
    #endif
    scanf("%lld",&n);
    for(int i=1;i<=n;i++)
        scanf("%lld",&a[i]),tmp[i]=a[i];
    jc[0]=1;
    for(int i=1;i<=n;i++)
        jc[i]=jc[i-1]*i%mod;
    sort(tmp+1,tmp+1+n);
    unique(tmp+1,tmp+1+n);
    for(int i=1;i<=n;i++)
        a[i]=lower_bound(tmp+1,tmp+1+n,a[i])-tmp;
    for(int i=1;i<=n;i++)
    {
        for(int j=n;j>1;j--)
        {
            int ret=fi(j-1,a[i]);
            cha(j,a[i],ret);
            upd(f[j],ret);
        }
        cha(1,a[i],1);
        f[1]++;
    }
    for(int i=1;i<=n;i++)
        f[i]=f[i]*jc[n-i]%mod;
    for(int i=1;i<=n;i++)
        upd(ans,(f[i]-f[i+1]*(i+1))%mod);
    printf("%lld",ans);
    return 0;
}