#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x) cerr<< #x <<" = "<< x<<endl;
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
int lazy[MAXN<<2],mx[MAXN<<2],mn[MAXN<<2];
void shift(int nd){
int &ret=lazy[nd];
if(!ret)
return;
lazy[nd<<1]+=ret;mx[nd<<1]+=ret;mn[nd<<1]+=ret;
lazy[nd<<1|1]+=ret;mx[nd<<1|1]+=ret;mn[nd<<1|1]+=ret;
ret=0;
}
void inc(int l,int r,int val,int nd,int x,int y){
if(l>y or x>r)
return;
if(l<=x and y<=r){
mx[nd]+=val;
mn[nd]+=val;
lazy[nd]+=val;
return;
}
shift(nd);
int mid=(x+y)>>1;
inc(l,r,val,nd<<1,x,mid);
inc(l,r,val,nd<<1|1,mid+1,y);
mx[nd]=max(mx[nd<<1],mx[nd<<1|1]);
mn[nd]=min(mn[nd<<1],mn[nd<<1|1]);
}
int main(){
//~ freopen("file.in", "r", stdin);
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++){
int p,t;
scanf("%d%d",&p,&t);
if(t==2)
inc(1,p,-1,1,1,n);
else
inc(1,p,+1,1,1,n);
int big=(mx[1]>0),small(mn[1]<0);
if(big and small)
puts("?");
else if(big)
puts(">");
else
puts("<");
}
return 0;
}
