{
TASK: roulette
LANG: PASCAL
}
const m_type = 15624;


var bt : array[0..6] of longint;
    a : array[0..56, 0..15624] of longint;
    turn, fl, g, t, g1, t1, i, j, k, l, o, p, m, n : longint;
    tu, ch : char;


procedure pre;
 begin
  for j := 0 to m_type do
    a[49, j] := 2;
 end;

procedure preprocessing;
var i, j, s, sum : longint;
    b : array[1..6] of longint;

 procedure skull(i : longint);
 var b : array[1..6] of longint;
     sum : longint;
  begin
   sum := 0;
       for b[1] := 0 to 4 do
       begin
        inc(sum, b[1]*1);
        if sum > i then
          begin
           dec(sum, b[1]*1);
           break;
          end;
        for b[2] := 0 to 4 do
          begin
           inc(sum, b[2]*2);
           if sum > i then
             begin
              dec(sum, b[2]*2);
              break;
             end;
           for b[3] := 0 to 4 do
             begin
           inc(sum, b[3]*3);
           if sum > i then
             begin
              dec(sum, b[3]*3);
              break;
             end;
              for b[4] := 0 to 4 do
                begin
           inc(sum, b[4]*4);
           if sum > i then
             begin
              dec(sum, b[4]*4);
              break;
             end;
                 for b[5] := 0 to 4 do
                   begin
           inc(sum, b[5]*5);
           if sum > i then
             begin
              dec(sum, b[5]*5);
              break;
             end;
                    for b[6] := 0 to 4 do
                      begin
           inc(sum, b[6]*6);
           if sum > i then
             begin
              dec(sum, b[6]*6);
              break;
             end;
                      j := 25*25*5*b[1] + 25*25*b[2] + 25*5*b[3] + 25*b[4] + 5*b[5] + b[6];
                      a[i, j] := 2;
                      for o := 1 to 6 do
                        begin
                         if b[o] < 4 then
                           begin
                            inc(b[o]);
                            p := 25*25*5*b[1] + 25*25*b[2] + 25*5*b[3] + 25*b[4] + 5*b[5] + b[6];
                            if a[i + o, p] = 2 then
                              begin
                               a[i, j] := 1;
                               dec(b[o]);
                               break;
                              end;
                            dec(b[o]);
                           end;
                        end;
                        dec(sum, b[6]*6);
                      end;
                      dec(sum, b[5]*5);
                  end;
                  dec(sum, b[4]*4);
               end;
               dec(sum, b[3]*3);
            end;
            dec(sum, b[2]*2);
         end;
         dec(sum, b[1]*1);
      end;
  end;

 begin
  sum := 0;
  for i := 48 downto 1 do
    begin
     skull(i);
    end;
 end;






procedure input;
 begin
  while not(eoln) do
   begin
    read(ch);
    inc(i);
    k := ord(ch) - 48;
    inc(bt[k]);
    if i mod 2 = 1 then inc(g, k)
    else inc(t, k);
   end;
 end;

begin
 pre;
 input;
 if i mod 2 = 1 then tu := 'T'
 else tu := 'G';
{ if (g = 3) and (t = 3) then writeln(tu, ' 6')
 else if (g + t <= 10) then writeln(tu, ' 0')
 else}
 begin
 preprocessing;
 p := 25*25*5*bt[1] + 25*25*bt[2] + 25*5*bt[3] + 25*bt[4] + 5*bt[5] + bt[6];
 if a[g + t, p] = 2 then writeln(tu, ' ', 0)
 else
   begin
    write(tu, ' ');
    for o := 6 downto 1 do
      begin
       if bt[o] < 4 then
         begin
          inc(bt[o]);
          p := 25*25*5*bt[1] + 25*25*bt[2] + 25*5*bt[3] + 25*bt[4] + 5*bt[5] + bt[6];
          dec(bt[o]);
          if a[g + t + o, p] = 2 then
            begin
             writeln(o);
             break;
            end;
         end;
      end;
   end;
 end;
end.














