#54886: python 枚舉法
hchen1029@icloud.com
(陳毓)
因為總共的排列組合只有3!=6種，所以其實可以枚舉所有的解法，並同時維護一個最小值(最佳解)
from itertools import permutations
while True:
try:
li = list(map(int,input().split()))
A = ["B","G","C"]
lst=[[(A[i%3],li[i+3*_]) for i in range(3)] for _ in range(3) ]
colors=[_ for _ in permutations(A,3) ]
best_ans = float('inf')
best_str = ""
print(f"{''.join(best_str)} {best_ans}")
except EOFError:
break