words = {
    '0': "CCC",
    '>': "ACG",
    '<': "UGA",
    '+': "UGC",
    '-': "UAC",
    '.': "GCG",
    ',': "UCC",
    '[': "AGG",
    ']': "UGU",
    '9': "CAC"
}


def convert(S):
    return "".join(words[x] for x in S)


def solve(p):
    # divmod
    X = ">" + ("+" * p) + "<[>->+<[>]>[<+>-]<<[<]>-]>[-]>[-<<+>>]<<"
    # B は、[1,>x,y] のときに [1,>10x+y] にする
    # B = C + D + E
    # C は、[1,>x,y,0,0] のときに [1,>0,y,0,10x] にする
    # D は [1,>0,y,0,10x] のときに [1,>0,0,0,10x+y] にする
    E = ">>>[-<<<+>>>]<<<"
    D = ">[->>+" + X + "<<]<"
    C = "[->>>" + 10 * ("+" + X) + "<<<]"
    B = C + D + E
    # ANS = f"+[>{A}<]"
    # [1,>x] のときに、[1,>10x+y] にするのが A
    # [1,x,>y,1] にしたあと、y=0 以外はポインタをずらす
    A = ">,9>+<+" + "[>>]>[<<[[-].0]+.0]" + "<<-<-<" + B
    ANS = f"+[9>{A}<]"

    ANS = ANS.replace("9", "")
    return convert(ANS)


n = int(input())
print(solve(n))