Const
 Smb=[' ',',','.','?','!',':',';','"','(',')','-'];
VAR
 S:String;
 W:Array[1..1000] of String;
 i,j,i1,i2,Ifix:Integer;
 leng,N,N_short:Byte;
 f:Text;

BEGIN
 Assign(f, 'D:\fff.txt');
 ReSet(f);
 N:=0;
 REPEAT
  ReadLn(f,S);
  i:=0;
  Repeat
   Repeat
    Inc(i);
   Until (Not (S[i] in Smb)) or (i=Length(S));
   If i<Length(S) then
    begin
     i1:=i;
     While (Not (S[i] in Smb)) and (i<Length(S)) do
      begin
       Inc(i);
       i2:=i;
      end;
    If (S[i] in Smb) and (i<Length(S)) then
      begin
       Inc(N);
       W[N]:=Copy(S,i1,i2-i1);
      end;
     If (Not (S[i] in Smb)) and (i=Length(S)) then
      begin
       Inc(N);
       W[N]:=Copy(S,i1,i-i1+1);
      end;
    end;
  Until i=Length(S);
 UNTIL EoF(f);
 Close(f);

 leng:=255;
 For i:=1 to N do
  If Length(W[i])<leng then
   begin
    Ifix:=i;
    leng:=Length(W[i]);
   end;
 Writeln('The shortest word is "'+W[Ifix]+'"');
 Writeln;
 N_short:=0;
 For i:=1 to N do
  If W[i]=W[Ifix] then  Inc(N_short);
 Writeln('It occurs ',N_short,' times');
 ReadLn
END.