// created:  2024-09-26 15:09:39
#include<cstdio>
#include<cctype>
#include<cstring>
#include<algorithm>
#include<chrono>
#include<random>
#define F(i,l,r) for(int i=(l),i##_end=(r);i<i##_end;++i)
#define I128 //||is_same<T,__int128_t>::value||is_same<T,__uint128_t>::value
using namespace std;
template<typename T>enable_if_t<is_integral<T>::value I128,void> readmain(T &x)
{
	bool neg=false;int c=getchar();
	for(;!isdigit(c);c=getchar())if(c=='-')neg=true;
	for(x=0;isdigit(c);c=getchar())x=(T)(10*x+(c-'0'));
	if(neg)x=-x;
}
template<typename T>T& read(T &x){readmain(x);return x;}
template<typename T,typename ...Tr>void read(T &x,Tr&... r){readmain(x);read(r...);}
typedef unsigned long long ull;
struct hash4
{
	static constexpr int MOD[4]={1036503019,937029311,897183317,920341061};
	static int bas[4];
	int a[4];
	void append(int c)
	{
		F(i,0,4)a[i]=(int)(((ull)a[i]*bas[i]+c)%MOD[i]);
	}
	friend bool operator<(const hash4 &u,const hash4 &v){return memcmp(&u,&v,sizeof(hash4))<0;}
	friend bool operator==(const hash4 &u,const hash4 &v){return !memcmp(&u,&v,sizeof(hash4));}
};
constexpr int hash4::MOD[4];
int hash4::bas[4];
constexpr int N=1e5+5,S=26;
int n,t,to[N][S],la[N][S],id[N],b[N],su[N];
hash4 sh[N],h[N];
char a[N],s[N];
int main()
{
	{
		mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
		F(i,0,4)hash4::bas[i]=(int)(rnd()%500000000+100000000);
	}
	scanf("%s",a);
	while(a[n])++n;
	F(i,0,n)
	{
		if(t&&s[t-1]==a[i])--t;
		else s[t++]=a[i],(sh[t]=sh[t-1]).append(a[i]);
		h[i+1]=sh[t];
	}
	if(t)return puts("-1"),0;
	F(i,0,n+1)id[i]=i;
	sort(id,id+n+1,[](const int &u,const int &v){return h[u]<h[v];});
	F(i,1,n+1)b[id[i]]=h[id[i]]==h[id[i-1]]?b[id[i-1]]:i;
	memset(la,0xff,sizeof(int)*S*n);
	F(i,0,n)
	{
		la[b[i+1]][a[i]-'a']=i;
		memcpy(to[i+1],la[b[i+1]],sizeof(int)*S);
	}
	su[0]=n;
	F(i,0,n)
	{
		if((su[t+1]=to[su[t]][a[i]-'a'])>i)putchar('('),++t;
		else putchar(')'),--t;
		if(t<0)return 1;
	}
	puts("");
	return 0;
}