#include <bits/stdc++.h>
using namespace std;
#define lowbit(x) ((x)&(-x))
using i64 = long long;
const int mod = 998244353;
//2024 misaka;
int n,a[1000015],t[1000015];
//2025 mikoto;
void add(int x,int k)
{
	for(int i=x;i<=n;i+=lowbit(i))t[i]+=k;
}

i64 qu(int l,int r)
{
	i64 ans=0;
	for(int i=l-1;i>=1;i-=lowbit(i))ans-=t[i];
	for(int i=r;i>=1;i-=lowbit(i))ans+=t[i];
	return ans;	
}

inline void solve()
{
	cin>>n;
	i64 ans=0;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
		add(a[i],1);
		ans=(ans+a[i]-qu(1,a[i]));//sum=sum+c,c??(1,a[i])??????????a[i]???
		ans=ans*max(n-i,1);//???sum=sum*base+c;?????????????sum=sum*base;
	}
	cout<<(ans+1)<<"\n";
}
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	solve();
	return 0;
}