#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

struct edge{
    int to, idx;
    edge(int to, int idx): to(to), idx(idx) {}
};

using P = pair<int, int>;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; cin >> n;
    vector<vector<edge>> g(n);
    vector<set<int>> h(n);
    vector<int> a(n), b(n);
    for(int i = 0; i < n; i++){
        cin >> a[i] >> b[i]; a[i]--;b[i]--;
        g[a[i]].push_back(edge(b[i], i));
        g[b[i]].push_back(edge(a[i], i));
        h[a[i]].insert(b[i]);
        h[b[i]].insert(a[i]);
    }
    map<P, int> mp;
    for(int i = 0; i < n; i++){
        mp[{a[i], b[i]}] = i;
        mp[{b[i], a[i]}] = i;
    }
    vector<string> ans(n);
    queue<int> que;
    for(int i = 0; i < n; i++){
        if(h[i].size() == 1) {
            que.push(i);
        }
    }
    auto del_edge = [&](int u, int v){
        h[u].erase(v);
        h[v].erase(u);
        if(h[u].size() == 1) {
            que.push(u);
        }
        if(h[v].size() == 1) {
            que.push(v);
        }
    };
    while(!que.empty()){
        auto u = que.front(); que.pop();
        int v = *h[u].begin();
        int idx = mp[{u, v}];
        if(a[idx] == u){
            ans[idx] = "->";
        }else{
            ans[idx] = "<-";
        }
        del_edge(u, v);
    }
    int s = -1;
    for(int i = 0; i < n; i++){
        if(!h[i].empty()){
            s = i;
            break;
        }
    }
    vector<bool> seen(n);
    vector<int> cycle;
    function<void(int)> dfs = [&](int v){
        seen[v] = true;
        cycle.push_back(v);
        for(int to: h[v]){
            if(!seen[to]) dfs(to);
        }
    };
    dfs(s);
    for(int i = 0; i < cycle.size(); i++){
        int j = (i+1)%(cycle.size());
        int u = cycle[i];
        int v = cycle[j];
        int idx = mp[{u, v}];
        if(a[idx] == u){
            ans[idx] = "->";
        }else{
            ans[idx] = "<-";
        }
    }

    print_vector(ans, '\n');
}