Timus 1846

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define test int t; cin>>t; for(int cs=1;cs<=t;cs++)
ll a[100005];
ll tree[400005];

void treeconstruct(ll node,ll b,ll e)
{

    if(b==e)
    {
        tree[node]=a[b];
        return;
    }

    ll left = node*2;
    ll right = node*2 + 1ll;

    ll mid=(b+e)/2;

    treeconstruct(left,b,mid);
    treeconstruct(right,mid+1,e);

    tree[node]=__gcd(tree[left],tree[right]);

}

ll queries(ll node,ll b,ll e,ll i,ll j)
{
    if(i>e || j<b) return 0;

    if(b>=i && e<=j) return tree[node];


    ll left = node*2;
    ll right = node*2 + 1ll;

    ll mid=(b+e)/2;

    ll x=queries(left,b,mid,i,j);

    ll y=queries(right,mid+1,e,i,j);

    return __gcd(x,y);

}

void update(ll node,ll b,ll e,ll i,ll newv)
{
    if(i>e || i<b) return;

    if(b>=i && e<=i)
    {
        tree[node]=newv;
        return;
    }

    ll left = node*2;
    ll right = node*2 + 1ll;

    ll mid=(b+e)/2;

    update(left,b,mid,i,newv);

    update(right,mid+1,e,i,newv);

    tree[node]=__gcd(tree[left],tree[right]);

}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);


    ll n,m,i,j,k,l=1;

    map<ll,set<ll>>x;
    char c;

    cin>>n;

    treeconstruct(1,1,n);

    for(i=1;i<=n;i++)
    {
         cin>>c>>m;
         if(c=='+')
         {
              update(1,1,n,l,m);
              x[m].insert(l);
              l++;
         }
         else
         {
              auto dd=x[m].begin();
              if(dd!=x[m].end())
              {
                   update(1,1,n,*dd,0);
                   x[m].erase(dd);
              }
         }

         cout<<max(1ll,queries(1,1,n,1,n))<<endl;
    }

    return 0;
}