#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second

mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60;
const int IINF = 1 << 30;

template<typename T> struct Edge{
    int to; T w;
    Edge(int to_, T w_=1){
        to = to_;
        w=w_;
    }
};
template<typename T> using Tree = vector<vector<Edge<T>>>;
template<typename T> using Graph = vector<vector<Edge<T>>>;
/* 容量&重み付きエッジ for Dinic */
template<typename T> struct REdge{
    int to;
    T cap;
    T cost;
    int rev;
    REdge(int to_, T cap_, T cost_=1){
        to = to_;
        cap = cap_;
        cost = cost_;
    }
    
    REdge(int to_, T cap_, T cost_, int rev_){
        to = to_;
        cap = cap_;
        cost = cost_;
        rev = rev_;
    }
};

/* 残余グラフ for Dinic */
template<typename T> using RGraph = vector<vector<REdge<T>>>;

template<typename T>
struct Namori{
    int n;
    vector<int> root; //root[閉路上の頂点]=自身の頂点, root[閉路外の頂点]=根頂点
    vector<int> par; //par[閉路上の頂点]=-1, par[閉路外の頂点]=親頂点

    Namori(Graph<T> &graph){
        n = (int)graph.size();
        root.resize(n, 0); for(int v=0; v<n; v++) root[v]=v;
        par.resize(n, -1);
        init(graph);
    }

    void init(Graph<T> &graph){
        //閉路上の頂点を決定
        vector<int> deg(n, 0);
        for(int v=0; v<n; v++) deg[v] = (int)graph[v].size();
        queue<int> Q;
        for(int v=0; v<n; v++) if(deg[v]==1) Q.push(v);

        while(!Q.empty()){
            int v = Q.front();
            Q.pop();
            root[v] = -1;
            for(Edge<T> e : graph[v]){
                deg[e.to]--;
                if(deg[e.to]==1) Q.push(e.to);
            }
        }

        function<void(int, int)> dfs = [&](int v, int p){
            root[v] = root[p];
            par[v] = p;
            for(Edge<T> e : graph[v]) if(e.to != p) dfs(e.to, v);
        };

        for(ll r=0; r<n; r++){
            if(root[r]!=r) continue;
            for(Edge<T> e : graph[r]){
                if(root[e.to]==e.to) continue;
                dfs(e.to, r);
            }
        }
    }

    int get_root(int v){return root[v];}
    int get_par(int v){return par[v];}
};

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int n; cin >> n;
    Graph<int> G(n);
    vector<pair<int, int>> E(n);
    rep(i, n){
        int a, b; cin >> a >> b;
        a--; b--;
        G[a].pb(Edge<int>(b));
        G[b].pb(Edge<int>(a));
        E[i] = {a, b};
    }

    Namori<int> nmr(G);
    vector<int> ans(n, -1);
    for(int i=0; i<n; i++){
        if(nmr.get_root(E[i].fi)==E[i].fi && nmr.get_root(E[i].se)==E[i].se) continue;
        if(nmr.get_par(E[i].fi)==E[i].se) ans[i] = 0;
        else ans[i] = 1;
    }

    vector<vector<pair<int, int>>> Cycle(n);
    int s = 0;
    for(int i=0; i<n; i++){
        if(nmr.get_root(E[i].fi)==E[i].fi && nmr.get_root(E[i].se)==E[i].se){
            Cycle[E[i].fi].pb({E[i].se, i});
            Cycle[E[i].se].pb({E[i].fi, i});
            s = E[i].fi;
        }

    }

    int t = Cycle[s][0].fi;
    if(E[Cycle[s][0].se].fi==s) ans[Cycle[s][0].se] = 0;
    else ans[Cycle[s][0].se] = 1;

    function<void(int, int)> dfs = [&](int u, int p){
        if(u == s) return;
        for(pair<int, int> tmp : Cycle[u]){
            int v = tmp.fi;
            int idx = tmp.se;
            if(p == v) continue;
            if(E[idx].fi==u) ans[idx] = 0;
            else ans[idx] = 1;
            dfs(v, u);
        }
    };

    dfs(t, s);
    for(int i=0; i<n; i++){
        if(ans[i]==0) cout << "->" << endl;
        else cout << "<-" << endl;
    }
}