#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 4000000000000000001



int main(){
	
	int n;
	cin>>n;
	vector<int> a(n),b(n);
	vector<vector<int>> E(n);
	vector<int> d(n);
	rep(i,n){
		cin>>a[i]>>b[i];
		a[i]--,b[i]--;
		E[a[i]].push_back(i);
		E[b[i]].push_back(i);
		d[a[i]]++;
		d[b[i]]++;
	}
	vector<int> ans(n,-1);
	priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> Q;
	rep(i,n){
		Q.emplace(d[i],i);
	}
	vector<bool> used(n,false);
	while(Q.size()>0){
		auto r = Q.top();
		Q.pop();
		if(d[r.second]!=r.first)continue;
		int u = r.second;
		rep(i,E[r.second].size()){
			int ii = E[r.second][i];
			int v = u ^ a[ii] ^ b[ii];
			if(ans[ii]!=-1)continue;
			if(used[u]==false){
				if(u<v)ans[ii] = 0;
				else ans[ii] = 1;
				used[u] = true;
			}
			else{
				if(u<v)ans[ii] = 1;
				else ans[ii] = 0;
				used[v] = true;
			}
			d[u]--,d[v]--;
			Q.emplace(d[u],u);
			Q.emplace(d[v],v);
			break;
		}
	}
	rep(i,n){
		if(ans[i]==0)cout<<"->"<<endl;
		else cout<<"<-"<<endl;
	}
	return 0;
}