#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
using namespace std;

struct Namori {
    vector<vector<int>> forest;
    vector<int> loop;
    Namori(vector<vector<int>> &G) {
        int N = G.size();
        vector<int> deg(N);
        forest.resize(N);
        rep(i, N) deg[i] = G[i].size();

        queue<int> q;
        vector<bool> seen(N);
        rep(i, N) {
            if (deg[i] == 1) {
                q.emplace(i);
                seen[i] = true;
            }
        }

        while (!q.empty()) {
            int u = q.front();
            q.pop();

            for (int v : G[u]) {
                if (seen[v]) continue;
                deg[v]--;

                forest[u].emplace_back(v);
                forest[v].emplace_back(u);

                if (deg[v] == 1) {
                    q.emplace(v);
                    seen[v] = true;
                }
            }
        }

        rep(i, N) {
            if (!seen[i])
                loop.emplace_back(i);
        }
    }
};

int main() {
    cin.tie(0)->sync_with_stdio(0);

    int N;
    cin >> N;
    map<pair<int, int>, int> edges;
    vector<vector<int>> G(N);
    rep(i, N) {
        int u, v;
        cin >> u >> v;
        u--, v--;
        edges[{u, v}] = i;
        edges[{v, u}] = -i;
        G[u].emplace_back(v);
        G[v].emplace_back(u);
    }

    Namori na(G);
    vector<string> ans(N);
    int n = na.loop.size();
    rep(i, n) {
        int u = na.loop[i];
        int v = na.loop[(i + 1) % n];
        int id = edges[{u, v}];

        if (id < 0)
            ans[-id] = "<-";
        else
            ans[id] = "->";
    }

    vector<bool> seen(N);
    for (int i : na.loop) seen[i] = true;
    for (int i : na.loop) {
        if (G[i].size() == 0) continue;

        queue<int> q;
        q.push(i);
        while (!q.empty()) {
            int u = q.front();
            q.pop();

            for (int v : G[u]) {
                if (seen[v]) continue;
                seen[v] = true;
                q.push(v);

                int id = edges[{u, v}];
                if (id < 0)
                    ans[-id] = "->";
                else
                    ans[id] = "<-";
                break;
            }
        }
    }

    for (auto &a : ans) cout << a << "\n";

    return 0;
}