#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll inf=1e18;
ll n,a[1100000],b[1100000],m,i,j,k,l,r,x,y,z,w,s,t,ans[1100000],query[1100000];
vector<pair<ll,ll>> rollback[1100000];
char c[1100000];
int main()
{
    scanf("%s",c);
    n=strlen(c);
    for(i=1;i<=n;i++)
    {
        if(c[i-1]=='(')
            a[i]=1;
        if(c[i-1]==')')
            a[i]=-1;
        if(c[i-1]=='-')
            a[i]=0;
    }
    t=0;
    z=500000;
    b[z]=1;
    for(i=1;i<=n;i++)
    {
        if(a[i]==1)
        {
            t++;
            z++;
            rollback[t].push_back({inf,s});
            s+=b[z];
            rollback[t].push_back({z,b[z]});
            b[z]=1;
            ans[t]=s;
            query[t]=1;
            printf("%lld\n",s);
        }
        if(a[i]==-1)
        {
            t++;
            rollback[t].push_back({z,b[z]});
            b[z]=0;
            z--;
            rollback[t].push_back({inf,s});
            s+=b[z];
            b[z]++;
            rollback[t].push_back({z,b[z]-1});
            ans[t]=s;
            query[t]=-1;
            printf("%lld\n",s);
        }
        if(a[i]==0)
        {
            for(auto pp:rollback[t])
            {
                if(pp.first==inf)
                {
                    s=pp.second;
                    continue;
                }
                b[pp.first]=pp.second;
            }
            rollback[t].clear();
            if(query[t]==1)
                z--;
            else
                z++;
            t--;
            printf("%lld\n",ans[t]);
        }
    }
}