// #pragma GCC target("avx")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i = (int)a; i < (int)b; i++)
#define all(x) x.begin(),x.end()
//#define mp make_pair
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vvvvi vector<vvvi>
#define pii pair<int,int>
#define vpii vector<pair<int,int>>

template<typename T>
void chmax(T &a, const T &b) {a = (a > b? a : b);}
template<typename T>
void chmin(T &a, const T &b) {a = (a < b? a : b);}

using ll = long long;
using ld = long double;
using ull = unsigned long long;

const ll INF = numeric_limits<long long>::max() / 2;
const ld pi = 3.1415926535897932384626433832795028;
const ll mod = 998244353;
int dx[] = {1, 0, -1, 0, -1, -1, 1, 1};
int dy[] = {0, 1, 0, -1, -1, 1, -1, 1};

#define int long long

void solve() {
    int n;
    cin >> n;
    vi a(n), b(n);
    vector<vpii> g(n);
    FOR(n) {
        cin >> a[i] >> b[i];
        --a[i];
        --b[i];
        g[a[i]].emplace_back(b[i], i);
        g[b[i]].emplace_back(a[i], i);
    }

    vi end;
    FOR(n) if(g[i].size() == 1) end.push_back(i);
    if(end.size() <= 1) {
        int now = (end.size() == 0? 0 : end.front());
        vi done(n, false);
        vi ans(n, 0);
        while(!done[now]) {
            done[now] = true;
            ans[g[now][0].second] = now;
            now = g[now][0].first;
        }
        ans[g[now][0].second] = now;
        FOR(n) {
            if(ans[i] == a[i]) cout << "->" << endl;
            else cout << "<-" << endl;
        }
    }else {
        vi ans(n, 0);
        vi done(n, false);
        bool flag = true;

        auto dfs = [&](int v, auto self) -> void {
            // cout << v << endl;
            done[v] = true;
            if(g[v].size() <= 2) {
                for(auto e : g[v]) {
                    if(!done[e.first]) {
                        ans[e.second] = v;
                        self(e.first, self);
                    }
                }
            }else {
                if(!flag) return;
                for(auto e : g[v]) {
                    if(!done[e.first]) {
                        ans[e.second] = v;
                        self(e.first, self);
                        break;
                    }
                }
                flag = false;
            }
        };
        dfs(end[0], dfs);
        flag = true;
        dfs(end[1], dfs);

        FOR(n) {
            if(ans[i] == a[i]) cout << "->" << endl;
            else cout << "<-" << endl;
        }
    }
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}