#include<cstdio>

#include<algorithm>

#include<cstring>

#define N 800010

#define MOD 1000000

#define which(x) (ls[fa[(x)]]==(x))

typedef long long ll;

using namespace std;

int n,root,tot,val[N],fa[N],ls[N],rs[N],sze[N],cnt[N],flag,op,value;

ll ans;

int read()

{

    int ret=,neg=;

    char j=getchar();

    for (;j>'' || j<'';j=getchar())

    if (j=='-') neg=-;

    for (;j>='' && j<='';j=getchar())

    ret=ret*+j-'';

    return ret*neg;

}

void Upt(int x) {sze[x]=sze[ls[x]]+sze[rs[x]]+;}

void Rotate(int u)

{

    int v=fa[u],w=fa[v],b=which(u)?rs[u]:ls[u];

    if (w) which(v)?ls[w]=u:rs[w]=u;

    which(u)?(ls[v]=b,rs[u]=v):(rs[v]=b,ls[u]=v);

    fa[u]=w,fa[v]=u;

    if (b) fa[b]=v;

    Upt(v),Upt(u);

}

void Splay(int x)

{

    while (fa[x])

    {

    if (fa[fa[x]])

        if (which(x)==which(fa[x])) Rotate(fa[x]);

        else Rotate(x);

    Rotate(x);

    }

    root=x;

}

void Insert(int x)

{

    int cur=root,v=;

    while (cur)

    if (x<val[v=cur]) cur=ls[cur];

    else cur=rs[cur];

    fa[++tot]=v,val[tot]=x,sze[tot]=;

    if (v) x<val[v]?ls[v]=tot:rs[v]=tot;

    Splay(tot);

}

int Find(int x)

{

    int cur=root,v=;

    while (cur && val[cur]!=x)

    if (x<val[v=cur]) cur=ls[cur];

    else cur=rs[cur];

    return cur?cur:v;

}

int getmin(int x)

{

    while (ls[x]) x=ls[x];

    return x;

}

int getmax(int x)

{

    while (rs[x]) x=rs[x];

    return x;

}

int getpre(int x)

{

    int u=Find(x);

    Splay(u);

    if (val[u]<=x) return u;

    return getmax(ls[u]);

}

int getnxt(int x)

{

    int u=Find(x);

    Splay(u);

    if (val[u]>=x) return u;

    return getmin(rs[u]);

}

void Erase(int x)

{

    Splay(x);

    if (ls[x]== && rs[x]==) root=;

    else

    if (ls[x]== || rs[x]==) root=ls[x]+rs[x],fa[root]=;

    else{

        fa[ls[x]]=;

        int v=getmax(ls[x]);

        Splay(v);

        rs[v]=rs[x],fa[rs[x]]=v,Upt(root);

    }

}

int main()

{

    n=read();

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

    {

    op=read(),value=read();

    if (sze[root]==)

       Insert(value),flag=op;

    else if (op!=flag)

    {

        int u=getpre(value),v=getnxt(value);

        if (u!= && (v== || value-val[u]<=val[v]-value))

        ans=(ans+value-val[u])%MOD,Erase(u);

        else ans=(ans+val[v]-value)%MOD,Erase(v);

    }

    else Insert(value);

    }

    printf("%lld",ans);

    return ;

}