#include <bits/stdc++.h>
using namespace std;
const int MaxI=1024;
const int MaxD=11;
int N;
int func(int D,int I,int tree[11][2048]){
int ans=0;
return ans;
}
int main() {
cin>>N;
int D[N+1];
int I[N+1];
for(int n=1;n<=N;n++){
cin>>D[n]>>I[n];
}
for(int n=1;n<=N;n++){
int tree[11][2048]={};
func(D[n],I[n],tree);
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmNvbnN0IGludCBNYXhJPTEwMjQ7CmNvbnN0IGludCBNYXhEPTExOwppbnQgTjsKCmludCBmdW5jKGludCBELGludCBJLGludCB0cmVlWzExXVsyMDQ4XSl7CglpbnQgYW5zPTA7CgkKCXJldHVybiBhbnM7Cn0KCmludCBtYWluKCkgewoJY2luPj5OOwoJaW50IERbTisxXTsKCWludCBJW04rMV07Cglmb3IoaW50IG49MTtuPD1OO24rKyl7CgkJY2luPj5EW25dPj5JW25dOwoJfQoJZm9yKGludCBuPTE7bjw9TjtuKyspewoJCWludCB0cmVlWzExXVsyMDQ4XT17fTsKCQlmdW5jKERbbl0sSVtuXSx0cmVlKTsKCX0KCXJldHVybiAwOwp9