#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
using namespace std;
using ll = long long;
constexpr int INF = 1e9;
constexpr ll LINF = 1e18;
string YesNo(bool cond) {
    return cond ? "Yes" : "No";
}
string YESNO(bool cond) {
    return cond ? "YES" : "NO";
}
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
bool chmin(T& a, const T& b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template <typename T, class F>
T bisect(T ok, T ng, const F& f) {
    while (abs(ok - ng) > 1) {
        T mid = min(ok, ng) + (abs(ok - ng) >> 1);
        (f(mid) ? ok : ng) = mid;
    }
    return ok;
}
template <typename T, class F>
T bisect_double(T ok, T ng, const F& f, int iter = 100) {
    while (iter--) {
        T mid = (ok + ng) / 2;
        (f(mid) ? ok : ng) = mid;
    }
    return ok;
}
template <class T>
vector<T> make_vec(size_t a) {
    return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
    return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template <typename T>
istream& operator>>(istream& is, vector<T>& v) {
    for (int i = 0; i < int(v.size()); i++) {
        is >> v[i];
    }
    return is;
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < int(v.size()); i++) {
        os << v[i];
        if (i < sz(v) - 1) os << ' ';
    }
    return os;
}
int main() {
    int n;
    cin >> n;
    vector<vector<int>> g(n);
    vector<pair<int, int>> e(n);
    rep(i, n) {
        int a, b;
        cin >> a >> b;
        a--, b--;
        g[a].push_back(b);
        g[b].push_back(a);
        e[i] = {a, b};
    }
    vector<int> pre(n, -1);
    pre[0] = 0;
    vector<int> cycle;
    {
        auto dfs = [&](auto dfs, int u) -> void {
            for (int v : g[u]) {
                if (v == pre[u]) continue;
                if (pre[v] != -1) {
                    while (u != v) {
                        cycle.push_back(u);
                        u = pre[u];
                    }
                    cycle.push_back(v);
                    throw 0;
                }
                pre[v] = u;
                dfs(dfs, v);
            }
        };
        try {
            dfs(dfs, 0);
        } catch (int _) {
        }
    }

    map<pair<int, int>, string> ans;
    rep(i, sz(cycle)) {
        int u = cycle[i];
        int v = cycle[(i + 1) % sz(cycle)];
        ans[{u, v}] = "->";
        ans[{v, u}] = "<-";
    }
    vector<int> in_cycle(n, false);
    for (int u : cycle) in_cycle[u] = true;
    auto dfs = [&](auto dfs, int u, int p) -> void {
        for (int v : g[u]) {
            if (v == p) continue;
            if (in_cycle[v]) continue;
            ans[{v, u}] = "->";
            ans[{u, v}] = "<-";
            dfs(dfs, v, u);
        }
    };
    for (int u : cycle) dfs(dfs, u, -1);
    for (auto [u, v] : e) {
        cout << ans[{u, v}] << '\n';
    }
}