var
 n,i,j,temp,ans:longint;
 a,b,num,nn,tot:array[0..50010]of longint;

 procedure guibing(l,r:longint);
 var
   i,j,mid,k:longint;
 begin
   if l=r then exit;
   mid:=(l+r)div 2;
   guibing(l,mid);
   guibing(mid+1,r);
   i:=l;
   j:=mid+1;
   k:=l;
   while(i<=mid)and(j<=r) do
     begin
       if a[i]>=a[j] then
         begin b[k]:=a[i];nn[k]:=num[i];inc(k);inc(i);end
        else begin
         b[k]:=a[j];nn[k]:=num[j];
         inc(nn[k],mid-i+1);
         inc(k);inc(j);
        end;
     end;

   while i<=mid do
    begin b[k]:=a[i];nn[k]:=num[i];inc(k);inc(i);end;
   while j<=r do
    begin b[k]:=a[j];nn[k]:=num[j];inc(k);inc(j);end;

   for i:=l to r do begin a[i]:=b[i];num[i]:=nn[i];end;
 end;

begin
assign(input,'queueb.in');reset(input);
assign(output,'quequeb.out');rewrite(output);
 fillchar(num,sizeof(num),0);
 readln(n);
 for i:=1 to n do read(a[i]);
 guibing(1,n);

 i:=n;
 while i>=1 do
  begin
   temp:=n-i;
   j:=i;
   while a[j]=a[i]do begin tot[j]:=temp;dec(j);end;
   i:=j;
  end;
 ans:=0;
 for i:=1 to n do
  begin
   ans:=ans+num[i]*(tot[i]-num[i]);
  end;
 writeln(ans);

 {for i:=1 to n do write(a[i],' ');writeln;
 for i:=1 to n do write(tot[i],' ');writeln;
 for i:=1 to n do write(num[i],' ');writeln; }
close(input);close(output);
end.