import sys
input = sys.stdin.readline
INF = float('inf')
sys.setrecursionlimit(10**7)
from collections import deque


def main():
    N = int(input())
    AB = []
    g = [[] for _ in range(N)]
    for _ in range(N):
        a, b = map(int, input().split())
        a, b = a - 1, b - 1
        AB.append((a, b))
        g[a].append(b)
        g[b].append(a)

    def dfs(u, prev, target=-1):
        for v in g[u]:
            if v in (prev, target):
                continue
            if distance[v] == INF:
                distance[v] = distance[u] + 1
                dfs(v, u)
            elif distance[v] < distance[u]:
                is_loop[u] = is_loop[v] = True
                if target == -1:
                    target = v
                dfs(prev, u, target)

    distance = [INF] * N
    distance[0] = 0
    is_loop = [False] * N
    dfs(0, -1)

    def bfs(u):
        que = deque([u])
        while que:
            u = que.popleft()
            for v in g[u]:
                if is_loop[v]:
                    continue
                if distance[v] == INF:
                    distance[v] = distance[u] + 1
                    que.append(v)

    distance = [INF] * N
    # 端点からbfs
    for i in range(N):
        if len(g[i]) == 1:
            distance[i] = 0
            bfs(i)

    def dfs2(u, prev=-1):
        for v in g[u]:
            if v == prev:
                continue
            if distance[v] == INF:
                distance[v] = distance[u] + 1
                dfs2(v, u)

    # 残った点からdfs
    for i in range(N):
        if distance[i] == INF:
            # 閉路判断用にバカでか初期値
            distance[i] = 1 << 18
            dfs2(i)

    # 答え出力
    for a, b in AB:
        if is_loop[a] and is_loop[b]:
            if distance[b] - distance[a] == 1 or distance[a] - distance[b] > 1:
                print('->')
            else:
                print('<-')
        else:
            if distance[a] < distance[b]:
                print('->')
            else:
                print('<-')


main()