#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #pragma warning(push) #pragma warning(disable:26498 26450 26451 26812) #include "atcoder/all" #pragma warning(pop) //#include //using namespace boost::multiprecision; // std::fixed << std::setprecision(10) using namespace std; using namespace atcoder; using ll = long long; using ull = unsigned long long; using mint = modint998244353; using mint2 = modint1000000007; const double eps = 1e-9; #define REP(i, n) for (ll i = 0; i < (n); ++i) #define REPI(i, init, n) for (ll i = init; i < (n); ++i) #define REPD(i, init) for (ll i = init; i >=0; --i) #define REPE(i, c) for (const auto& i : c) using vl = vector; #define VL(a, n) vector a; a.assign(n, 0); #define VLI(a, n) vector a; a.assign(n, 0); for(auto& x : a) cin >> x; #define VSI(a, n) vector a; a.assign(n, ""); for(auto& x : a) cin >> x; using vvl = vector>; #define VVLI(a, n, m, init) vector> a(n); for(auto& x : a) x.assign(m, init); struct uv { ll u; ll v; ll c; }; #define VUVI(a, n) vector a; a.assign(n, {0, 0, 1}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;} #define VUVCI(a, n) vector a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;} vvl to_edge(const int n, const vector& v) { vvl ret(n); for (auto& x : v) ret[x.u].push_back(x.v); return ret; } vvl to_edge_d(const int n, const vector& v) { vvl ret(n); for (auto& x : v) { ret[x.u].push_back(x.v); ret[x.v].push_back(x.u); } return ret; } template using pql = priority_queue; template using pqg = priority_queue, greater>; const char* YES = "Yes"; const char* NO = "No"; void yn(bool f) { std::cout << (f ? YES : NO) << endl; }; template void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } }; const ll llhuge = 1LL << 60; //十分でかいが多少足しても溢れない数値 template bool chmin(T& a, const U& b) { a = min(a, b); return b == a; } template bool chmax(T& a, const U& b) { a = max(a, b); return b == a; } template void mysort(T& v) { std::sort(begin(v), end(v)); }; template void mysort(T& v, U pr) { std::sort(begin(v), end(v), pr); }; template void myrev(T& v) { std::reverse(begin(v), end(v)); }; struct edge { ll to; ll i; bool rev = false; }; vector> e; vl use; ll del = -1; ll delp = -1; bool dfs1(ll i, ll p) { use[i] = 1; REPE(x, e[i]) { if (x.to == p) continue; if (use[x.to] == 1) { del = x.i; delp = x.to; return true; } if (dfs1(x.to, i)) return true; } return false; } vector ans; bool dfs2(ll i, ll p) { REPE(x, e[i]) { if (x.to == p) continue; if (x.i == del) { ans[x.i] = x.rev; } else { ans[x.i] = !x.rev; dfs2(x.to, i); } } return false; } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); ll n; cin >> n; e.assign(n, vector()); REP(i, n) { ll a, b; cin >> a >> b; a--; b--; e[a].push_back({ b, i, false }); e[b].push_back({ a, i, true }); } use.assign(n, 0); dfs1(0, -1); ans.assign(n, false); dfs2(delp, -1); REP(i, n) { cout << (ans[i] ? "<-" : "->") << endl; } return 0; }