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


def main():
    N = int(input())
    AB = []
    g = [set() 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].add(b)
        g[b].add(a)

    ans = dict()

    # トポロジカルソート風
    vis = [False] * N
    for i in range(N):
        if len(g[i]) == 1:
            que = deque([i])
            while que:
                u = que.popleft()
                vis[u] = True
                for v in g[u]:
                    g[v].discard(u)
                    if u < v:
                        ans[(u, v)] = '->'
                    else:
                        ans[(v, u)] = '<-'
                    if len(g[v]) == 1:
                        que.append(v)

    def dfs(u, prev=-1):
        for v in g[u]:
            if v != prev and not vis[v]:
                if u < v:
                    ans[(u, v)] = '->'
                else:
                    ans[(v, u)] = '<-'
                vis[v] = True
                dfs(v, u)

    # 残った閉路を処理する
    for i in range(N):
        if not vis[i]:
            dfs(i)
    
    # 答え出力
    for a, b in AB:
        print(ans[(a, b)])


main()