const Nmax=200000;
var x,b,i,j,o,n:integer;
 K:array[0..2] of integer;
input,output:text;
begin
assign (input,'task.in');
reset (input);
readln(input,N);
  for i:=1 to N do
 readln(input,K[j]);
 B:=0;
 for j:=0 to 2 do
  X:=K[j]; k[0]:=x;
  J:=o;
   while x<K[o+1] do
     begin
      K[j]:=K[o+1];
       o:=o+1;
       end;
       begin
     x:=k[o];
   end;
    for i:=1 to N do
  if (K[1]>K[1])and([K[2]>K[2])  then
 B:=b+1;
assign (output,'task.out');
rewrite(output);
write(output,B);
close(input);
close(output);
end.
close(output);
end.