uses crt;
var
 g1,o1,d1,v1,e1,k1,S:Array[1..100] of byte;
 g,o,d,v,e,k,l,i,M:byte;
begin
 clrscr;
 l:=0;
 for g:=1 to 9 do
  for o:=0 to 9 do
   for d:=0 to 9 do
    for v:=1 to 9 do
     for e:=0 to 9 do
      for k:=0 to 9 do
       if (4*(100*g+10*o+d)=100*v+10*e+k)
          and(g<>o)and(g<>d)and(g<>v)and(g<>e)and(g<>k)
          and(o<>d)and(o<>v)and(o<>e)and(o<>k)
          and(d<>v)and(d<>e)and(d<>k)
          and(v<>e)and(v<>k)
          and(e<>k) then
        begin
         Inc(l);
         writeln(g,o,d,'+',g,o,d,'+',g,o,d,'+',g,o,d,'=',v,e,k);
         S[l]:=v+e+k;
         g1[l]:=g;
         o1[l]:=o;
         d1[l]:=d;
         v1[l]:=v;
         e1[l]:=e;
         k1[l]:=k;
         If (l mod 20)=0 then
          begin
           write('Press Enter...');
           readln;
          end;
        end;
 M:=0;
 for i:=1 to l do
  if S[i]>M then M:=S[i];
 writeln;
 writeln('Combinations with maximal sum of figures in "vek" (',M,'):');
 for i:=1 to l do
  if S[i]=M then
   writeln(g1[i],o1[i],d1[i],'+',g1[i],o1[i],d1[i],'+',g1[i],o1[i],d1[i],'+',g1[i],o1[i],d1[i],'=',v1[i],e1[i],k1[i]);
 readln;
end.