#include <bits/stdc++.h>
#define int long long
#define pii pair < int, int >
#define fi first
#define se second
const int inf = 1e18;
const int maxn = 1e5 + 5;
const int offset = 1e6;
using namespace std;
#define mask(x) (1ll << x)
int n;
struct NODE {
int mx, mn, lz;
NODE () {
mx = 0;
mn = 0;
lz = 0;
}
NODE operator+ (const NODE &other) const {
NODE res;
res.mx = max(mx, other.mx);
res.mn = min(mn, other.mn);
return res;
}
} t[4 * maxn];
NODE base;
void push(int id, int l, int r) {
if (t[id].lz == 0) return;
for (int j = 0; j <= 1; j++) {
t[id * 2 + j].mx += t[id].lz;
t[id * 2 + j].mn += t[id].lz;
t[id * 2 + j].lz += t[id].lz;
}
t[id].lz = 0;
}
void update(int id, int l, int r, int u, int v, int val) {
if (l > v || r < u) return;
if (l >= u && r <= v) {
t[id].lz += val;
t[id].mx += val;
t[id].mn += val;
return;
}
push(id, l, r);
int m = (l + r) / 2;
update(id * 2, l, m, u, v, val);
update(id * 2 + 1, m + 1, r, u, v, val);
t[id] = t[id * 2] + t[id * 2 + 1];
}
NODE get(int id, int l, int r, int u, int v) {
if (l > v || r < u) return base;
if (l >= u && r <= v) return t[id];
int m = (l + r) / 2;
return get(id * 2, l, m, u, v) + get(id * 2 + 1, m + 1, r, u , v);
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
#define NAME "test"
if (fopen(NAME".INP","r")) {
freopen(NAME".INP","r",stdin);
freopen(NAME".OUT","w",stdout);
}
cin >> n;
for (int i = 1; i <= n; i++) {
int R, S;
cin >> R >> S;
int x;
if (S == 1) x = 1;
else x = -1;
update(1, 1, n, 1, R, x);
int mx = t[1].mx;
int mn = t[1].mn;
if (mn >= 0 && mx > 0) {
cout << '>';
} else if (mx <= 0 && mn < 0) {
cout << '<';
} else cout << '?';
cout << '\n';
}
}
