task2

const n=30;
var a:array[1..n] of longint;
    i,k:integer;
    min:longint;
Begin

  k:=0;
  min:=99909;

  for i:=1 to n do begin
    read(a[i]);
    if (a[i]<=99999) and (a[i]>=10000) and (a[i] mod 14=0) and ((a[i] div 10) mod 10=0) and (a[i]<min) then begin
      min:=a[i];
      k:=k+1;
    end;

  end;

  if k=0 then writeln('не обнаружено') else writeln(min);

End.