typedef long long ll;
typedef long double ld;
#include <bits/stdc++.h>
using namespace std;
#define int long long
// こっちを使おう！
// __builtin_popcountll

// modint
template<int MOD> struct Fp {
    long long val;
    constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
        if (val < 0) val += MOD;
    }
    constexpr int getmod() const { return MOD; }
    constexpr Fp operator - () const noexcept {
        return val ? MOD - val : 0;
    }
    constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
    constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
    constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
    constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
    constexpr Fp& operator += (const Fp& r) noexcept {
        val += r.val;
        if (val >= MOD) val -= MOD;
        return *this;
    }
    constexpr Fp& operator -= (const Fp& r) noexcept {
        val -= r.val;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr Fp& operator *= (const Fp& r) noexcept {
        val = val * r.val % MOD;
        return *this;
    }
    constexpr Fp& operator /= (const Fp& r) noexcept {
        long long a = r.val, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b, swap(a, b);
            u -= t * v, swap(u, v);
        }
        val = val * u % MOD;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr bool operator == (const Fp& r) const noexcept {
        return this->val == r.val;
    }
    constexpr bool operator != (const Fp& r) const noexcept {
        return this->val != r.val;
    }
    friend constexpr istream& operator >> (istream& is, Fp<MOD>& x) noexcept {
        is >> x.val;
        x.val %= MOD;
        if (x.val < 0) x.val += MOD;
        return is;
    }
    friend constexpr ostream& operator << (ostream& os, const Fp<MOD>& x) noexcept {
        return os << x.val;
    }
    friend constexpr Fp<MOD> modpow(const Fp<MOD>& r, long long n) noexcept {
        if (n == 0) return 1;
        if (n < 0) return modpow(modinv(r), -n);
        auto t = modpow(r, n / 2);
        t = t * t;
        if (n & 1) t = t * r;
        return t;
    }
    friend constexpr Fp<MOD> modinv(const Fp<MOD>& r) noexcept {
        long long a = r.val, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b, swap(a, b);
            u -= t * v, swap(u, v);
        }
        return Fp<MOD>(u);
    }
};

// const int MOD = 1000000007;
const int MOD = 998244353;
using mint = Fp<MOD>;


signed main(){
    ll n;
    std::cin >> n;
    vector<set<ll>> edges(n);
    map<pair<ll,ll>,ll> mi;
    vector<bool> im(n); //true -> 
    for (int i = 0; i < n; i++) {
        ll a,b;
        std::cin >> a>>b;
        a--;b--;
        edges[a].insert(b);
        edges[b].insert(a);
        mi[{a,b}]=i;
    }
    priority_queue<pair<ll,ll>,vector<pair<ll,ll>>,greater<pair<ll,ll>>> pq;
    for (int i = 0; i < n; i++) {
        pq.push({edges[i].size(), i});
    }
    
    ll last = 0;
    
    while(!pq.empty()){
        auto [size, i] = pq.top();pq.pop();
        if(size!=edges[i].size())continue;
        
        if(edges[i].size()==1){
            for (auto e : edges[i]) {
                // std::cout << i<<" "<<e << std::endl;
                if(i<e){
                    im[mi[{i,e}]]=true;
                }else{
                    im[mi[{e,i}]]=false;
                }
                edges[i].erase(e);
                edges[e].erase(i);
                pq.push({edges[e].size(),e});
                break;
            }
        }else{
            last = i;
            break;
        }
    }
    ll now = last;
    ll prev = -1;
    while(true){
        for (auto e : edges[now]) {
            if(e==prev)continue;
            //  std::cout << now<<" "<<e << std::endl;
            if(now<e){
                 im[mi[{now,e}]]=true;
            }else{
                 im[mi[{e,now}]]=false;
            }
            prev = now;
            now = e;
            break;
        }
        if(now==last)break;
    }
    for (int i = 0; i < n; i++) {
        if(im[i]){
            std::cout << "->" << std::endl;
        }else{
            std::cout << "<-" << std::endl;
        }
    }
}