#include<iostream>

#include<cstdio>

#include<cmath>

#include<cstdlib>

#include<cstring>

#include<algorithm>

using namespace std;

int read()

{

    int x=,f=;char c=getchar();

    while (c<''||c>'') {if (c=='-') f=-;c=getchar();}

    while (c>=''&&c<='') x=(x<<)+(x<<)+(c^),c=getchar();

    return x*f;

}

#define N 100010

#define M 300000

int m,n,q,a[N],b[N],mn[N],ans[N],fa[N*];

bool flag[N*];

const int block=;

int find(int x){return fa[x]==x?x:fa[x]=find(fa[x]);}

int main()

{

#ifndef ONLINE_JUDGE

    freopen("bzoj4320.in","r",stdin);

    freopen("bzoj4320.out","w",stdout);

    const char LL[]="%I64d\n";

#else

    const char LL[]="%lld\n";

#endif

    m=read();

    for (int i=;i<=block;i++) mn[i]=i;

    while (m--)

    {

        char c=getchar();while (c!='A'&&c!='B') c=getchar();

        a[++n]=read();

        if (c=='A')

        {

            b[n]=;flag[a[n]]=;

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

            mn[i]=min(mn[i],a[n]%i);

        }

        else if (a[n]<=block) ans[n]=mn[a[n]];

    }

    fa[M+]=M+;

    for (int i=M;i>=;i--) if (flag[i]) fa[i]=i;else fa[i]=fa[i+];

    for (int i=n;i>=;i--)

    if (b[i]) fa[a[i]]=find(a[i]+);

    else if (a[i]>block)

    {

        ans[i]=M+;

        for (int j=;j<=M;j+=a[i])

        {

            int p=find(j);

            if (p<min(j+a[i],M+)) ans[i]=min(ans[i],p%a[i]);

        }

    }

    for (int i=;i<=n;i++) if (!b[i]) printf("%d\n",ans[i]);

    return ;

}