#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<iostream>
#include<ctime>
using namespace std;
int n;
int opt;
int x;
int size[100010][2];
int rs[100010][2];
int ls[100010][2];
long long v[100010][2];
int w[100010][2];
int r[100010][2];
int tot[2];
int root[2];
long long ans;
int answer_back;
int answer_front;
int answer_front1;
int answer_back1;
void up(int x,int s)
{size[x][s]=size[rs[x][s]][s]+size[ls[x][s]][s]+w[x][s];
}
void rturn(int &x,int s)
{int t;t=ls[x][s];ls[x][s]=rs[t][s];rs[t][s]=x;size[t][s]=size[x][s];up(x,s);x=t;
}
void lturn(int &x,int s)
{int t;t=rs[x][s];rs[x][s]=ls[t][s];ls[t][s]=x;size[t][s]=size[x][s];up(x,s);x=t;
}
void insert_sum(int x,int &i,int s)
{if(!i){i=++tot[s];w[i][s]=size[i][s]=1;v[i][s]=x;r[i][s]=rand();return ;}size[i][s]++;if(x==v[i][s]){w[i][s]++;}else if(x>v[i][s]){insert_sum(x,rs[i][s],s);if(r[rs[i][s]][s]<r[i][s]){lturn(i,s);}}else{insert_sum(x,ls[i][s],s);if(r[ls[i][s]][s]<r[i][s])    {rturn(i,s);}}return ;
}
void delete_sum(int x,int &i,int s)
{if(i==0){return ;}if(v[i][s]==x){if(w[i][s]>1){w[i][s]--;size[i][s]--;return ;}if((ls[i][s]*rs[i][s])==0){i=ls[i][s]+rs[i][s];}else if(r[ls[i][s]][s]<r[rs[i][s]][s]){rturn(i,s);delete_sum(x,i,s);}else{lturn(i,s);delete_sum(x,i,s);}return ;}size[i][s]--;if(v[i][s]<x){delete_sum(x,rs[i][s],s);}else{delete_sum(x,ls[i][s],s);}return ;
}
int ask_num(int x,int i,int s)
{if(i==0){return 0;}if(v[i][s]==x){return size[ls[i][s]][s]+1;}if(v[i][s]<x){return ask_num(x,rs[i][s],s)+size[ls[i][s]][s]+w[i][s];}return ask_num(x,ls[i][s],s);
}
void ask_front(int x,int i,int s)
{if(i==0){return ;}if(v[i][s]<x){answer_front1=i;ask_front(x,rs[i][s],s);return ;}else{ask_front(x,ls[i][s],s);return ;}return ;
}
void ask_back(int x,int i,int s)
{if(i==0){return ;}if(v[i][s]>x){answer_back1=i;ask_back(x,ls[i][s],s);return ;}else{ask_back(x,rs[i][s],s);return ;}
}
int main()
{srand(12378);scanf("%d",&n);v[0][0]=v[0][1]=1000000000;for(int i=1;i<=n;i++){answer_front1=answer_back1=0;scanf("%d%d",&opt,&x);if(size[root[opt^1]][opt^1]==0){insert_sum(x,root[opt],opt);}else{if(v[ask_num(x,root[opt^1],opt^1)][opt^1]==x){delete_sum(x,root[opt^1],opt^1);}else{ask_front(x,root[opt^1],opt^1);ask_back(x,root[opt^1],opt^1);answer_front=v[answer_front1][opt^1];answer_back=v[answer_back1][opt^1];if(abs(answer_back-x)==abs(answer_front-x)){ans+=abs(answer_front-x);delete_sum(answer_front,root[opt^1],opt^1);}             else if(abs(answer_back-x)>abs(answer_front-x)){ans+=abs(answer_front-x);delete_sum(answer_front,root[opt^1],opt^1);}else{ans+=abs(answer_back-x);delete_sum(answer_back,root[opt^1],opt^1);} }}ans%=1000000;}printf("%lld",ans%1000000);return 0;
}