#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <set>

using namespace::std;


int find_cycle(int n, const vector<vector<int>>& e) {
  vector<bool> visited(n + 1);
  vector<pair<int, int>> q;
  for (int i = 1; i <= n; ++i)
    if (!visited[i]) {
      q.push_back({-1, i});
      while (!q.empty()) {
        auto [u, v] = q.back();
        q.pop_back();
        if (visited[v]) return v;
        visited[v] = 1;
        for (int w : e[v]) if (w != u) q.push_back({v, w});
      }
    }
  return -1;
}

int main() {
  ios::sync_with_stdio(false);
  long long n;
  cin >> n;
  vector<pair<int, int>> input;
  vector<vector<int>> e(n + 1);
  for (int i = 0; i < n; ++i) {
    int a, b;
    cin >> a >> b;
    input.push_back({a, b});
    e[a].push_back(b);
    e[b].push_back(a);
  }
  
  int c = find_cycle(n, e);
  
  vector<int> p(n + 1);
  vector<pair<int, int>> q {{0, c}};
  while (!q.empty()) {
    auto [u, v] = q.back();
    q.pop_back();
    if (p[v]) continue;
    p[v] = u;
    for (int w : e[v]) q.push_back({v, w});
  }
  
  for (const auto [a, b] : input)
    cout << (p[a] == b ? "->" : "<-") << endl;
  
  

  
  return 0;
}