Program Perm_k;
const
  Max = 100;
type
  tpole = array[1..Max] of integer;
var
  perm : tpole;
  i,n  : integer;
function KPerm(n : integer; var perm : tpole) : longint;
 var
  i,j,p : integer;
  fact  : longint;
  k     : longint;

 begin
  fact:=1;
  k:=1;

  for i:=n downto 1 do
   begin
    p:=perm[i];
    for j:=1 to i do
      if (perm[j] < perm[i]) then
        dec(p);
    k:=k+fact*(p-1);
    fact:=fact*(n+1-i);
  end;

  KPerm:=k;
 end;

begin

  read(n);
  for i:=1 to n do
    read(perm[i]);

  writeln('poradove cislo permutace je ',Kperm(n,perm));
  readln;

end.