int Power_Cantor()
{int ans=0;for(int i=1;i<=n-1;i++){scanf("%d",&a[i]);int sum=0;for(int j=1;j<=a[i];j++)sum+=vis[j];vis[a[i]]=1;a[i]-=sum+1;ans=(ans+a[i])*(n-i);}return ans+1;
}

int Cantor()
{int ans=0;for(int i=1;i<=n-1;i++){int now=a[i];now-=query(1,1,n,1,a[i])+1;update(1,1,n,a[i],1);ans=(ans+now)*(n-i);}return ans+1;
}

int search(int num)
{int l=1,r=n;while(l<r){int mid=l+r>>1;int find=query(1,1,n,l,mid);if(find>=num) r=mid;else{l=mid+1;num-=find;}}return r;
}void R_Cantor(int num)
{num--;  memset(a,0,sizeof a);build_tree(1,1,n);for(int i=1;i<=n;i++){a[i]=num/(jc[n-i]);a[i]=search(a[i]+1);update(1,1,n,a[i],0);num%=jc[n-i];}for(int i=1;i<=n;i++)printf("%d ",a[i]);puts("");
}

#include <algorithm>
#include <cstring>
#include <cstdio>
#include <iostream>
using namespace std;
const int N = 1e5+10;int n;
int a[N],tree[3*N];
int jc[10]={1,1,2,6,24,120,720,5040,40320,362880}; void out()
{for(int i=1;i<=14;i++){printf("tree[%d] = %d\n",i,tree[i]);}puts("");
}void build_tree(int node,int start,int end)
{if(start==end){tree[node]=1;return;}int mid=start+end>>1;int left=2*node;int right=2*node+1;build_tree(left,start,mid);build_tree(right,mid+1,end);tree[node]=tree[left]+tree[right];
}void update(int node,int start,int end,int idx,int val)
{if(start==end){tree[node]=val;return;}int mid=start+end>>1;int left=2*node;int right=2*node+1;if(idx<=mid)update(left,start,mid,idx,val);else update(right,mid+1,end,idx,val);tree[node]=tree[left]+tree[right];
}int query(int node,int start,int end,int l,int r)
{if(end<l || start>r)return 0;else if(start>=l && end<=r)return tree[node];int mid=start+end>>1;int left=2*node;int right=2*node+1;return query(left,start,mid,l,r) + query(right,mid+1,end,l,r);
}int Cantor()
{int ans=0;for(int i=1;i<=n-1;i++){int now=a[i];now-=query(1,1,n,1,a[i])+1;update(1,1,n,a[i],1);ans=(ans+now)*(n-i);}return ans+1;  //所有全排列中比该序列小的有ans个，故该序列排在第ans+1位
}int search(int num)
{int l=1,r=n;while(l<r){int mid=l+r>>1;int find=query(1,1,n,l,mid);// 先看左子树中未出现的比要求的数小的数的个数够不够num个 // 若足够，则继续往左子树找num // 若不够，则继续往右子树找 (num-已找到的个数) if(find>=num) r=mid;else{l=mid+1;num-=find;}}return r;
}void R_Cantor(int num)
{num--; //该序列排在第num位，故比其小的全排列有num-1个。 memset(a,0,sizeof a);build_tree(1,1,n);for(int i=1;i<=n;i++){a[i]=num/(jc[n-i]);a[i]=search(a[i]+1);update(1,1,n,a[i],0);num%=jc[n-i];}for(int i=1;i<=n;i++)printf("%d ",a[i]);puts("");
}int main()
{scanf("%d",&n);for(int i=1;i<=n;i++)scanf("%d",&a[i]);memset(tree,0,sizeof tree);int ans=Cantor();//    R_Cantor(62);
printf("%d\n",ans);return 0;
}