codeforces 494a//Treasure// Codeforces Round #282(Div. 1)

//#pragma comment(linker,"/STACK:1024000000,1024000000") 
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
#include <stack>
#include <list>
using namespace std;
const int SZ=1000010,INF=0x7FFFFFFF;
typedef long long lon;
const double EPS=1e-9;

int work(string &str)
{
    int res=0;
    stack<char> stk;
    for(int i=0;i<str.size();++i)
    {
        if(str[i]==‘(‘)
        {
            stk.push(str[i]);
        }
        else
        {
            if(stk.empty())
            {
                return INF;
            }
            else
            {
                stk.pop();
            }
        }
    }
    return stk.size();
}

bool work2(string &str)
{
    stack<char> stk;
    for(int i=0;i<str.size();++i)
    {
        if(str[i]==‘(‘)
        {
            stk.push(‘(‘);
        }
        else
        {
            if(!stk.empty())
            {
                stk.pop();
            }
        }
    }
    return stk.empty();
}

int main()
{
    std::ios::sync_with_stdio(0);
    //freopen("d:\\1.txt","r",stdin); 
    string str;
    cin>>str;
    int resnum=count(str.begin(),str.end(),‘#‘);
    int last=str.find_last_of(‘#‘);
    string sub=str.substr(last+1,str.size());
    //cout<<sub<<endl;
    for(int i=0;i<str.size();++i)
    {
        if(str[i]==‘#‘)str[i]=‘)‘;
    }
    int res=work(str);
//    int cnt1=count(str.begin()+last+1,str.end(),‘(‘);
//    int cnt2=count(str.begin()+last+1,str.end(),‘)‘);
//    if(cnt1>cnt2)res=INF;
    //cout<<resnum<<endl;
    if(!work2(sub))res=INF;
    if(res!=INF)
    for(int i=0;i<resnum;++i)
    {
        if(i!=resnum-1)cout<<1<<endl;
        else cout<<1+res<<endl;
    }
    else cout<<-1<<endl;
    return 0;
}