program zavorky;
uses crt;
LABEL KC;
type zaznam= record
                z: string; {zavorka}
                v: integer; {prirazeni cisla zarovce}
             end;
const N =30;

var c: char;
    A: array [1..N] of zaznam;
    B: array [1..N] of integer;
    i, j :integer;
    w : string;
    f : text;
    g : text;
    pocet,s : integer;
    k : integer;
    pole: array [1..N] of integer;
    jsoutam: boolean;
    je: boolean;

procedure ctiZavorku;
var zn : char;
    koneczavorky : boolean;
begin
  w:='';
  while (not eoln(f)) and (not koneczavorky) do
   begin  read (f, zn);
          if (zn=' ') then koneczavorky:=true
           else w:=w + zn;
      end;
  if (eoln(f)) then readln(f, zn);
end;

procedure hledej;
var   i: integer;
begin
  i:=0; je:=true;
  repeat i:=i+1 until ((A[i].z='') or (A[i].z=w));
  if (A[i].z=w)  then  begin je:=true;
                       pole[j]:=A[i].v;
                       inc(j);
                      end
  else je:=false;
end;


begin
 assign(f,'.\typy.txt');
 reset(f);
 pocet:=0;

 for i:=1 to N do
   begin A[i].z:='';
         A[i].v:=0;
    end;

 i:=1;
 while (not eof(f)) do begin
    ctiZavorku;
    if (w<>'') then begin
      A[i].z:=w;
      inc(i); inc(pocet);
     end;
  end;


 k:=1;
 for i:=1 to (pocet div 2) do              {priradim zavorkam cisla}
   begin A[2*i-1].v :=k;
        A[2*i].v :=-k;
        inc(k);
   end;


 close(f);

 assign(g,'.\retezec.txt');
 reset(g);

 {kontrola, zda  tam muze byt}

{ w:=''};read(g,c); w:=c;
 while (not eof(g)) do
  begin j:=1; hledej;
        if je then repeat begin
                      w:='';
                      read(g,c);
                      w:=c;
                      hledej
                end
              until ((je=false) or eof(g))

        else begin
          read(g,c);
          w:=w+c;
          end;
  end;

 if w=c then begin writeln ('jsou tam'); jsoutam:=true; end
 else begin jsoutam:=false;  writeln ('nejsou tam'); goto KC; end;

for i:=1 to N do
 B[i]:=0;

j:=1; k:=1;
while (pole[j]) <>0 do
 begin if (pole[j] <> -B[k]) and (pole[j]<0) then s:=1;
       if pole[j]=-B[k] then begin B[k]:=0; k:=k-1; end;
       if pole[j] > b[k] then begin B[k+1]:=pole[j]; k:=k+1; end;
       inc(j);
 end;

if (k=1) and (s=1) then writeln  ('dobre')
else writeln ('takze spatne');
KC:
readkey;
end.



