#include <bits/stdc++.h>
using namespace std;
const int N=1e6+10;
stack<int> a;
int arr[N],ans[N],brr[N];
int main() {
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>arr[i]>>brr[i];
}
for(int i=n;i>=1;i--){
while(!a.empty()&&arr[a.top()]<=arr[i]){
a.pop();
}
if(a.empty()){
ans[i]=0;
}else{
ans[i]=a.top();
}
a.push(i);
}
int maxx=0;
for(int i=1;i<=n;i++){
cout<<ans[i];
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmNvbnN0IGludCBOPTFlNisxMDsKc3RhY2s8aW50PiBhOwppbnQgYXJyW05dLGFuc1tOXSxicnJbTl07CmludCBtYWluKCkgewoJaW50IG47CgljaW4+Pm47Cglmb3IoaW50IGk9MTtpPD1uO2krKyl7CgkJY2luPj5hcnJbaV0+PmJycltpXTsKCX0KCWZvcihpbnQgaT1uO2k+PTE7aS0tKXsKCQl3aGlsZSghYS5lbXB0eSgpJiZhcnJbYS50b3AoKV08PWFycltpXSl7CgkJCWEucG9wKCk7CgkJfQoJCWlmKGEuZW1wdHkoKSl7CgkJCWFuc1tpXT0wOwoJCX1lbHNlewoJCQlhbnNbaV09YS50b3AoKTsKCQl9CgkJYS5wdXNoKGkpOwoJfQoJaW50IG1heHg9MDsKCWZvcihpbnQgaT0xO2k8PW47aSsrKXsKCQljb3V0PDxhbnNbaV07Cgl9CglyZXR1cm4gMDsKfQo=