binarySearch

const SIZE = 10000;
var
ar:array[1..SIZE] of integer;
Function binSearch(x:integer): integer;
Var
l, r, m:integer;
success:boolean;
Begin
  success:=false;
  l:=1;
  r:=SIZE;
  while l <= r do
  begin
    m:=l + (r - l) div 2;
    if ar[m] = x then begin
      success:=true;
      break;
    end;
    if ar[m] > x then begin
      r:= m - 1;
    end
    else
      l:=m + 1;
  end;
  if success = true then
    binSearch:= m
  else
    binSearch:=-1;
End;

begin
  for var i:=1 to SIZE do
    ar[i]:= i;
  for var i:=1 to SIZE do begin
      if (binSearch(i) = -1) or (ar[binSearch(i)] <> i) then
        writeln(i);
  end
end.