#include <iostream>

 #include <cstdio>

 #include <cstdlib>

 #define inf 0x7fffffff

 #define P 1000000

 using namespace std;

 struct SplayNode

 {

     SplayNode *fa,*ch[];

     SplayNode();

     int data,size,num;

     int chr() {return this==fa->ch[];}

     void updata() {size=ch[]->size+ch[]->size+num;}

 }*null;

 SplayNode::SplayNode() {fa=ch[]=ch[]=null; num=; size=;}

 int n,sum;

 inline int read() {char c; int ans=; while ((c=getchar())==' ' || c=='\r' || c=='\n'); ans=c-''; while (isdigit(c=getchar())) ans=ans*+c-''; return ans;}

 namespace Splay

 {

     SplayNode *Root[];

     void MakeTree()

     {

         null=new SplayNode;

         *null=SplayNode();

         Root[]=null;

         Root[]=null;

     }

     void rotate(SplayNode *x,int num)

     {

         SplayNode *r=x->fa;

         if (x==null || r==null) return;

         int t=x->chr();

         r->ch[t]=x->ch[t^];

         r->ch[t]->fa=r;

         if (r->fa==null) Root[num]=x;

         else r->fa->ch[r->chr()]=x;

         x->fa=r->fa;

         x->ch[t^]=r;

         r->fa=x;

         r->updata();

         x->updata();

     }

     void splay(SplayNode *x,SplayNode *r,int num)

     {

         for (;x->fa!=r;rotate(x,num))

             if (x->fa->fa!=r)

                 if (x->chr()==x->fa->chr()) rotate(x->fa,num);

                 else rotate(x,num);

     }

     void insert(int v,int num)

     {

         SplayNode *r=Root[num];

         if (Root[num]==null)

         {

             Root[num]=new SplayNode;

             Root[num]->data=v;

             Root[num]->updata();

             return;

         }

         while (r->ch[r->data<v]!=null) r=r->ch[r->data<v];

         r->ch[r->data<v]=new SplayNode;

         r->ch[r->data<v]->data=v;

         r->ch[r->data<v]->fa=r;

         splay(r->ch[r->data<v],null,num);

     }

     SplayNode *find(int v,int num)

     {

         int lsum=inf,rsum=inf;

         SplayNode *r=Root[num],*l=null,*l1=null;

         while (r!=null)

         {

             if (r->data==v)

             {

                 splay(r,null,num);

                 return r;

             }

             if (abs(r->data-v)<lsum && r->data<v) lsum=abs(r->data-v),l=r;

             if (abs(r->data-v)<rsum && r->data>v) rsum=abs(r->data-v),l1=r;

             r=r->ch[r->data<v];

         }

         if (lsum<=rsum)

         {

             sum=(sum+lsum)%P;

             splay(l,null,num);

             return l;

         }

         else

         {

             sum=(sum+rsum)%P;

             splay(l1,null,num);

             return l1;

         }

     }

     void pre(SplayNode *x,SplayNode *&ans)

     {

         SplayNode *r=x->ch[];

         if (r==null) return;

         while (r->ch[]!=null) r=r->ch[];

         ans=r;

     }

     void suc(SplayNode *x,SplayNode *&ans)

     {

         SplayNode *r=x->ch[];

         if (r==null) return;

         while (r->ch[]!=null) r=r->ch[];

         ans=r;

     }

     void del(int v,int num)

     {

         SplayNode *r=find(v,num);

         SplayNode *q=null,*p=null; pre(Root[num],q); suc(Root[num],p);

         if (q==null && p==null)

         {

             Root[num]=null;

             return;

         }

         if (q==null)

         {

             splay(p,null,num);

             Root[num]->ch[]=null;

             Root[num]->updata();

             return;

         }

         if (p==null)

         {

             splay(q,null,num);

             Root[num]->ch[]=null;

             Root[num]->updata();

             return;

         }

         splay(q,null,num);

         splay(p,q,num);

         p->ch[]=null;

         p->updata();

     }

 }

 int main()

 {

     n=read();

     Splay::MakeTree();

     for (int i=;i<=n;i++)

     {

         int x,temp;

         temp=read(); x=read();

         if (Splay::Root[temp^]->size!=)

             Splay::del(x,temp^);

         else

             Splay::insert(x,temp);

         sum%=P;

     }

     printf("%d\n",sum%P);

     return ;

 }