#include <bits/stdc++.h>
using namespace std;
int main(){
  int N;
  cin >> N;
  vector<vector<pair<int, int>>> E(N);
  for (int i = 0; i < N; i++){
    int A, B;
    cin >> A >> B;
    A--;
    B--;
    E[A].push_back(make_pair(i, B));
    E[B].push_back(make_pair(i, A));
  }
  vector<int> d(N);
  for (int i = 0; i < N; i++){
    d[i] = E[i].size();
  }
  vector<string> ans(N);
  queue<int> Q;
  for (int i = 0; i < N; i++){
    if (d[i] == 1){
      Q.push(i);
    }
  }
  vector<bool> used(N, false);
  while (!Q.empty()){
    int v = Q.front();
    Q.pop();
    used[v] = true;
    for (auto e : E[v]){
      int w = e.second;
      if (d[w] > 1){
        if (v < w){
          ans[e.first] = "->";
        } else {
          ans[e.first] = "<-";
        }
        d[w]--;
        if (d[w] == 1){
          Q.push(w);
        }
      }
    }
  }
  for (int i = 0; i < N; i++){
    if (!used[i]){
      int v = i;
      used[v] = true;
      while (true){
        bool ok = false;
        for (auto e : E[v]){
          int w = e.second;
          if (!used[w]){
            if (v < w){
              ans[e.first] = "->";
            } else {
              ans[e.first] = "<-";
            }
            used[w] = true;
            v = w;
            ok = true;
            break;
          }
        }
        if (!ok){
          for (auto e : E[v]){
            int w = e.second;
            if (w == i){
              if (v < w){
                ans[e.first] = "->";
              } else {
                ans[e.first] = "<-";
              }
              break;
            }
          }
          break;
        }
      }
    }
  }
  for (int i = 0; i < N; i++){
    cout << ans[i] << endl;
  }
}