from types import GeneratorType
from collections import deque

def bootstrap(f, stack=[]):
    def wrappedfunc(*args, **kwargs):
        if stack:
            return f(*args, **kwargs)
        to = f(*args, **kwargs)
        while True:
            if type(to) is GeneratorType:
                stack.append(to)
                to = next(to)
            else:
                stack.pop()
                if not stack:
                    break
                to = stack[-1].send(to)
        return to
    return wrappedfunc

N = int(input())
C = [list(input().split()) for _ in range(N)]
G = [[] for _ in range(N)]
for i in range(N):
    for j in range(4):
        if C[i][j] != "H":
            G[i].append(int(C[i][j])-1)

@bootstrap
def dfs(n):
    visited[n] = True
    flag = False
    for v in G[n]:
        if not visited[v]:
            yield dfs(v)
            flag = True
    if flag:
        que.appendleft("(")
        que.append("methyl)")
    else:
        que.append("(methyl)")
    yield

visited = [False]*N
visited[0] = True
que = deque()
ans = []
for v in G[0]:
    if not visited[v]:
        dfs(v)
        ans.append("".join(list(que)))

ans.append("methane")

print("".join(ans))