n = int(input())
edges = [[int(x)-1 for x in input().split()] for i in range(n)]
e = [[] for i in range(n)]
for ind,(a,b) in enumerate(edges):
    e[a].append([b,ind])
    e[b].append([a,ind])


ans = [-1]*n

num = [0]*n
for a,b in edges:
    num[a] += 1
    num[b] += 1

q = []
vis = [0]*n
for i in range(n):
    if num[i] == 1:
        q.append(i)

while q:
    now = q.pop()
    vis[now] = 1
    for nex,ind in e[now]:
        if ans[ind] != -1:
            continue
        num[nex] -= 1
        if edges[ind][0] == now:
            ans[ind] = 0
        else:
            ans[ind] = 1
        if num[nex] == 1:
            q.append(nex)

is_cycle = [0]*n
for i in range(n):
    if vis[i] == 0:
        q = [i]
        is_cycle[i] = 1
        break

while q:
    now = q.pop()
    for nex,ind in e[now]:
        if ans[ind] != -1:
            continue
        if edges[ind][0] == now:
            ans[ind] = 0
        else:
            ans[ind] = 1
        
        vis[nex] = 1
        q.append(nex)
        break





for i in ans:
    print("<-" if i else "->")