import sys
from collections import deque
input = sys.stdin.read
sys.setrecursionlimit(300000)
def bfs(start):
    queue = deque([(start, -1)])
    vis = [False] * (N + 1)
    vis[start] = True
    order = []

    while queue:
        n, par = queue.popleft()
        order.append((n, par))
        for nei in adj[n]:
            if not vis[nei]:
                vis[nei] = True
                queue.append((nei, n))

    names = [""] * (N + 1)
    for n, par in reversed(order):
        if not adj[n]:
            names[n] = "methane"
        else:
            branches = sorted(names[nei][:-3] for nei in adj[n] if nei != par)
            names[n] = "".join(f"({branch}yl)" for branch in branches) + "methane"

    return names[start]
d = input().split()
N = int(data[0])
adj = [[] for _ in range(N + 1)]
idx = 1
for i in range(1, N + 1):
    for _ in range(4):
        n = d[idx]
        idx += 1
        if n != 'H':
            adj[i].append(int(n))
print(bfs(1))