#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;
 
#include<bits/stdc++.h>
using namespace std;

vector<int> G[200200];

int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  
  int n;
  cin>>n;
  vector<int> A(n),B(n),deg(n);
  rep(i,n){
    cin>>A[i]>>B[i];
    A[i]--,B[i]--;
    G[A[i]].push_back(B[i]);
    G[B[i]].push_back(A[i]);
    deg[A[i]]++;
    deg[B[i]]++;
  }
  priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> que;
  rep(i,n) que.push({G[i].size(),i});
  
  vector<int> to(n,-1);
  while(que.size()){
    auto [a,b]=que.top(); que.pop();
    if(to[b]!=-1) continue;
    for(auto nv:G[b]){
      if(to[nv]==b) continue;
      to[b]=nv;
      deg[b]--;
      deg[nv]--;
      que.push({deg[nv],nv});
      break;
    }
  }
  rep(i,n){
    if(to[A[i]]==B[i]) cout<<"->"<<endl;
    else cout<<"<-"<<endl;
  }
  
  return 0;
}