#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

int main(){
  int N; cin >> N;
  vector<pair<int,int>> E(N);
  vector<set<int>> G(N);
  rep(i,N){
    int a,b; cin >> a >> b; a--; b--;
    G[a].insert(b);
    G[b].insert(a);
    E[i] = {a,b};
  }
  vector<int> D(N);
  auto H = G;
  queue<int> q;
  set<pair<int,int>> st;
  rep(i,N) if(sz(H[i])==1) q.push(i);
  while(!q.empty()){
    int n = q.front(); q.pop();
    for(auto x:H[n]){
      st.insert({n,x});
      H[x].erase(n);
      if(sz(H[x])==1){
        q.push(x);
      }
    }
    H[n].clear();
  }
  vector<int> P;
  rep(n,N){
    if(!H[n].empty()){
      int x = *H[n].begin();
      H[n].erase(x);
      H[x].erase(n);
      q.push(n);
      while(!q.empty()){
        int a = q.front(); q.pop();
        P.push_back(a);
        if(H[a].empty()) break;
        int x = *H[a].begin();
        H[a].clear();
        H[x].erase(a);
        q.push(x);
      }
      rep(i,sz(P)-1){
        st.insert({P[i],P[i+1]});
      }
      st.insert({x,n});
      break;
    }
  }
  rep(i,N){
    int a = E[i].first, b = E[i].second;
    if(st.count({a,b})) cout << "->\n";
    else cout << "<-\n";
  }
  return 0;
}