#yukicoder3278 Avoid Division

def solve():
    N = int(input())
    query = [tuple()] * N
    for i in range(N):
        op, Ai = input().split()
        query[i] = (op, int(Ai))

    #all add
    if all(op == '+' for op, _ in query):
        for i in range(1, N + 1):
            print(f'add a a A[{i}]')

    #そうでない場合: 普通に解く
    else:
        bunbo_flag = 0
        for i, (op, _) in enumerate(query, start = 1):
            if   op == '+':
                if bunbo_flag == 0:
                    print(f'add a a A[{i}]')
                else:
                    print(f'mul c b A[{i}]')
                    print(f'add a a c')
            elif op == '*':
                print(f'mul a a A[{i}]')
            elif op == '/':
                if bunbo_flag == 0:
                    print(f'add b b A[{i}]')
                    bunbo_flag = 1
                else:
                    print(f'mul b b A[{i}]')
        print(f'div a a b')

solve()