#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<vector<vector<int>>>to(n);
	vector<int>cnt(n);
	rep(i, n) {
		int u, v; cin >> u >> v;
		u--, v--;
		to[u].push_back({ v,i,1 });
		to[v].push_back({ u,i,-1 });
		cnt[u]++;
		cnt[v]++;
	}
	vector<int>ans(n, 0);
	queue<int>que;
	vector<int>par(n, -1);
	rep(i, n) {
		if (1 == cnt[i]) {
			que.push(i);
			cnt[i]--;
		}
	}
	while (!que.empty()) {
		int now = que.front();
		que.pop();
		for (auto ed : to[now]) {
			if (0 == cnt[ed[0]])continue;
			cnt[ed[0]]--;
			par[now] = ed[0];
			ans[ed[1]] = ed[2];
			if (1 == cnt[ed[0]]) {
				que.push(ed[0]);
				cnt[ed[0]] = 0;
			}
		}
	}
	rep(i, n) {
		if (-1 != par[i])continue;
		int now = i;
		vector<int>tmp;
		while (true) {
			bool flg = false;
			for (auto ed : to[now]) {
				if (i == ed[0])tmp = ed;
				if (-1 != par[ed[0]])continue;
				par[now] = ed[0];
				ans[ed[1]] = ed[2];
				now = ed[0];
				flg = true;
				break;
			}
			if (!flg) break;
		}
		ans[tmp[1]] = tmp[2];
		par[now] = i;
		break;
	}
	rep(i, n) {
		if (1 == ans[i])cout << "->" << endl;
		else if (-1 == ans[i])cout << "<-" << endl;
	}
	return 0;
}