#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<algorithm>

 #define int long long

 #define rep(i,s,e) for(register int i=s;i<=e;++i)

 #define dwn(i,s,e) for(fegister int i=s;i>+e;--i)

 #define maxn 5000000+10

 using namespace std;

 inline int read()

 {

     int x=;

     bool f=;

     char c=getchar();

     for(; !isdigit(c); c=getchar()) if(c=='-') f=;

     for(; isdigit(c); c=getchar()) x=(x<<)+(x<<)+c-'';

     if(f) return x;

     return -x;

 }

 inline void write(int x)

 {

     if(x<){putchar('-');x=-x;}

     if(x>)write(x/);

     putchar(x%+'');

 }

 int n,ans;

 int a[maxn],re[maxn];

 int tree[maxn];

 inline int lowbit(int x)

 {

     return x&-x;

 }

 inline void build(int x,int k)

 {

     for(int i=x;i<=n;i+=lowbit(i)) tree[i]+=k;

 }

 inline int ask(int x)

 {

     int res=;

     for(int i=x;i>=;i-=lowbit(i)) res+=tree[i];

     return res;

 }

 signed main()

 {

     n=read();

     rep(i,,n) a[i]=read(),re[i]=a[i];

     sort(a+,a+n+);

     int m=unique(a+,a+n+)-a-;

     rep(i,,n)

     {

         int now=lower_bound(a+,a+m+,re[i])-a;

         ans+=ask(m)-ask(now);

         build(now,);

     }

     write(ans);

     return ;

 }