#include <cstdio>
#include <algorithm>
#include <cstring>
#include <set>
#include <iostream>
using namespace std;
set<int> pet,owner;
int n,ans;

inline int diff(int x,int y){
    return max(x,y) - min(x,y);    
} 

inline int add(int x,int y){
    ans = (ans + ( diff(x,y) % 1000000 ) ) %1000000;
}
void solve(set<int> &set,int x){
    if(set.size()==1){
        add(x,*set.begin());
        set.clear();
    }
    else{
        std::set<int>::const_iterator r = set.lower_bound(x);
        if(r==set.begin()){
            add(x,*r);
            set.erase(r);
        }
        else{
            std::set<int>::const_iterator l = --set.lower_bound(x);
            if(r==set.end() || diff(x,*l) <= diff(x,*r)){
                add(x,*l);
                set.erase(l);
            }
            else{
                add(x,*r);
                set.erase(r);
            }
        }
    }
}

int main(){
    scanf("%d",&n);
    while(n--){
        int x,y;
        scanf("%d%d",&x,&y);
        if(x==0){
            if( owner.empty() ){
                pet.insert(y);
            }
            else{
                solve(owner,y);
            }
        }
        if(x==1){
            if( pet.empty() ){
                owner.insert(y);
            }
            else{
                solve(pet,y);
            }
        }
    }    
    printf("%d\n",ans);
    return 0;
}