1
Mamy
I Wani endio
tell WINNI
kwa
Coryantap som
One
NI MAM by a my
Anayan
Merrimae bytes
keve na walanie
euronewy brama
2. Tanepe urmesterenkiewin ratione per RTSELAN
Kadu ARTYSTY
More Turanzacion
Ranerna DCTV
HomepakKVARIK​

Ну типо так:
domains treetype = tree(integer, treetype, treetype); empty  

predicates

max_t(treetype, integer)
min_t(treetype, integer)
max(integer,integer,integer)
min(integer,integer,integer)  

clauses  

max(M,N,N) :- N>=M, !.
max(M,N,M) :- M>=N, !.  

min(M,N,N) :- N<=M, !.
min(M,N,M) :- M<=N, !.  

max_t(tree(X,empty,empty),X) :- !.
max_t(tree(X,empty,R),Q) :- max_t(R,N), max(X,N,Q). max_t(tree(X,L,empty),Q) :- max_t(L,N), max(X,N,Q).
max_t(tree(X,L,R),Q) :- max_t(L,LM), max_t(R,RM), max(RM,LM,QM), max(X,QM,Q).  

min_t(tree(X,empty,empty),X) :- !.
min_t(tree(X,empty,R),Q) :- min_t(R,N), min(X,N,Q). min_t(tree(X,L,empty),Q) :- min_t(L,N), min(X,N,Q).
min_t(tree(X,L,R),Q) :- min_t(L,LM), min_t(R,RM), min(RM,LM,QM), min(X,QM,Q).

//Pascal
var
  S: string;
  i, Count: byte;
begin
write('Введите строку: '); readln(S);
for i := Length(S) downto 1 do
if ((S[i] = '3') or (S[i] = '6') or (S[i] = '9')) then
begin
  Count := Count + 1;
  Delete(s,i,1);
end;
writeln('Количество цифр кратных трем = ', Count);    
writeln('Строка после удаления = ', S);
end.

//FreePascal/Delphi/PascalABC.NET(v3.3.1590)
{$MODE OBJFPC} //В PascalABC.NET можно убрать
uses SysUtils; //В PascalABC.NET можно убрать
var
  S: string;
  i, Count: byte;
begin
write('Введите строку: '); readln(S);
for i := Length(S) downto 1 do
try
if StrToInt(S[i]) mod 3 = 0 then
begin
  Count := Count + 1;
  Delete(s,i,1);
end;
except
end;
writeln('Количество цифр кратных трем = ', Count);   
writeln('Строка после удаления = ', S);
end.