program binary_search;

const Maximum = 100;
      DlzkaPola = 1000;

var x,y,i,j,l,r:longint;
    pole : array [1..DlzkaPola]of longint;
    nasiel:boolean;


begin



  for i:=1 to DlzkaPola do pole[i]:=random(Maximum)+1;

  for i:=1 to DlzkaPola do
    for j:=1 to DlzkaPola-1 do
      if pole[j]>pole[j+1] then
        begin
          y:=pole[j];
          pole[j]:=pole[j+1];
          pole[j+1]:=y;
        end;

  readln(x);


  while x<>0 do
  begin


    l:=1;
    r:=DlzkaPola;
    nasiel:=false;


    repeat

    if pole[(l+r)div 2] = x then
    begin

      writeln('Cislo ',x,' sa v poli nachadza!');
      nasiel:=true;
      break;

    end;

    if pole[(l+r)div 2] >x then r:=(r+l)div 2
    else l:=(r+l)div 2;




    until r-l<5;

    if not nasiel then for i:=l to r do if pole[i]=x then
    begin
      nasiel:=true;
      writeln('Cislo ',x,' sa v poli nachadza!');

    end;


    if not nasiel then writeln('Cislo ',x,' sa v poli nenachadza.');


    readln(x);

  end;






end.