import sys
from collections import deque, Counter
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 63 - 1
mod = 998244353

n = ii()

graph = [set() for _ in range(n)]

d = {}
ans = [None] * n
for i in range(n):
    u, v = mi()
    u -= 1; v -= 1
    d[u, v] = d[v, u] = i
    graph[u].add(v)
    graph[v].add(u)
q = []
for i in range(n):
    if len(graph[i]) == 1:
        q.append(i)

while q:
    now = q.pop()
    to = graph[now].pop()
    if now < to:
        ans[d[now, to]] = "->"
    else:
        ans[d[now, to]] = "<-"
    graph[to].discard(now)
    if len(graph[to]) == 1:
        q.append(to)

for i in range(n):
    if len(graph[i]) > 1:
        now = i
        to = graph[i].pop()
        if now < to:
            ans[d[now, to]] = "->"
        else:
            ans[d[now, to]] = "<-"
        graph[to].discard(now)
        if len(graph[to]) == 1:
            q.append(to)
        break

while q:
    now = q.pop()
    to = graph[now].pop()
    if now < to:
        ans[d[now, to]] = "->"
    else:
        ans[d[now, to]] = "<-"
    graph[to].discard(now)
    if len(graph[to]) == 1:
        q.append(to)

for v in ans:
    print(v)