#include "bits/stdc++.h"
using namespace std;
#define all(x) begin(x),end(x)
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { string sep; for (const T &x : v) os << sep << x, sep = " "; return os; }
#define debug(a) cerr << "(" << #a << ": " << a << ")\n";
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pi;
const int mxN = 1e5+1, oo = 1e9;
int main() {
    int n; cin >> n;
    vector<vector<pair<int,int>>> adj(n);
    for(int i=0;i<n;++i) {
        int a,b; cin >> a >> b;
        --a,--b;
        adj[a].push_back({b,i});
        adj[b].push_back({a,-i-1});
    }

    // find cycle, then take it as root.
    
    vector<bool> ans(n),vis(n);
    int root=-1;
    auto dfs = [&](auto&& self, int at, int from) -> void {
        vis[at]=1;
        for(auto [to,id] : adj[at]) if(to!=from) {
            if(vis[to]) {
                root=to;
            } else {
                self(self,to,at);

            }
        }
    };
    dfs(dfs,0,-1);
    fill(all(vis),0);
    auto dfs2 = [&](auto&& self, int at, int from) -> void {
        vis[at]=1;
        for(auto [to,id] : adj[at]) if(to!=from) {
            if(vis[to]) {
                if(to==root)if(id>=0) ans[id]=1;
            } else {
                self(self,to,at);
                if(id>=0) ans[id]=1;
            }
        }
    };
    dfs2(dfs2,root,-1);
    for(auto b : ans) {
        if(b) cout << "<-\n";
        else cout << "->\n";
    }
}