Олимпиадная задача

var
n:integer;
a:array [1..33] of integer;
input:text;
output:text;
current_index:integer;
minimal:integer;
index:integer;
coint:integer;
nonFounded:boolean;
 
//процедура сдвига массива
procedure offset_massive(index_first:integer);
begin
for var i:=index_first to N do
a[i]:=a[i+1];
end;
 
 
 
procedure poisk();
begin
current_index:=0;
for var i:=1 to N do
begin
Nonfounded:=true;
minimal:=i;
 
for var j:=1+current_index to N do
begin
if i=a[j] then begin Nonfounded:=false;current_index:=j; break; end;
end;
 
if Nonfounded then break;
end;
 
if nonFounded then begin
for var l:=1 to N do if minimal=a[l] then begin index:=l; end;
a[n+1]:=minimal;
coint:=coint+1;
 
offset_massive(index);
 poisk();
end;
end;
begin
coint:=0;
assign(input,'INPUT.TXT');
reset(input);
Readln(input,N);
for var i:=1 to N do
begin
Read(input,a[i]);
end;
 
poisk();
 
 
assign(output,'OUTPUT.TXT');
Rewrite(output);
Writeln(output,coint);
close(input);
close(output);
end.

var i, k, n: integer;
    a: array[1..32] of integer;
    f: text;
begin
  assign(f, 'input.txt');
  reset(f);
  readln(f, n);
  k := 1;
  for i := 1 to n do
    begin
      read(f, a[i]);
      if a[i] = k then inc(k)
    end;
  close(f);
  assign(f, 'output.txt');
  rewrite(f);
  writeln(f, n - k + 1);
  close(f)
end.