#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=2167167167167167167;
const int INF=2100000000;
const int mod=998244353;
#define rep(i,a,b) for (ll i=a;i<b;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}



void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,0,t) solve();
}

void solve(){
	int N;
	cin>>N;
	vector<vector<int>> G(N);
	vector<int> A(N),B(N);
	rep(i,0,N){
		int a,b;
		cin>>a>>b;
		a--,b--;
		A[i]=a;
		B[i]=b;
		G[a].push_back(b);
		G[b].push_back(a);
	}
	vector<int> p(N,-1);
	vector<int> D(N);
	vector<int> order;
	set<pair<int,int>> s;
	rep(i,0,N){
		D[i]=G[i].size();
		if(D[i]==1){
			order.push_back(i);
		}
	}
	rep(i,0,(int)(order.size())){
		int a=order[i];
		for(auto x:G[a]){
			if(D[x]==0) continue;
			p[a]=x;
			s.insert({x,a});
			D[x]--;
			if(D[x]==1) order.push_back(x);
		}
		D[a]=0;
	}
	rep(i,0,N){
		if(D[i]==0) continue;
		int ind=i;
		while(D[ind]!=0){
			for(auto x:G[ind]){
				if(p[x]!=ind){
					p[ind]=x;
					D[x]--;
					D[ind]--;
					s.insert({x,ind});
					ind=x;
					break;
				}
			}
		}
	}
	rep(i,0,N){
		if(s.count({A[i],B[i]})) cout<<"<-\n";
		else cout<<"->\n";
	}
}