#include<cstdio>
#include<algorithm>
#include<cstring>
const int Mo=(int)1e9+7;
using namespace std;
int F[105],P[105],Re[105],i,j,k,n,m,a[105],B[105],Sum,vis[105],ans,sum;
void pre()
{
      P[0]=P[1]=1;
      for (i=2;i<=100;++i) P[i]=1LL*P[i-1]*i%Mo;
      for (i=2;i<=100;++i)
      {
            for (j=1;j<=i;++j)
                for (k=1;k<=i;++k)
                    (F[i]+=1ll*P[i-2]*(k-1)%Mo*(i-j)%Mo)%=Mo;
      }
}
int main()
{
      pre();
      for (;scanf("%d",&n)!=EOF;)
    {
           ans=0; sum=0;
           memset(vis,0,sizeof(vis));
           for (i=1;i<=n;++i) scanf("%d",&a[i]);
           for (i=1;i<=n;++i) 
           {
               for (j=1;j<a[i];++j)
                 if (!vis[j]) 
              { 
                   int Sm=sum;
                    for (k=1;k<=n;++k)
                      if (!vis[k]&&k<j) ++Sm;
                    (ans+=(F[n-i]+1ll*P[n-i]*Sm%Mo)%Mo)%=Mo;
              }
              vis[a[i]]=1;
               for (k=1;k<=n;++k)
                      if (!vis[k]&&k<a[i]) ++sum;
          }
          printf("%d\n",ans);
    }
}