#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define int long long
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()

const int mxn = 1e5;
const int mod = 998244353;
const int p = 10;

int ksm(int a, int b=mod-2) {
	int res=1, aux=a;
	for (int i=1; i<=b; i*=2) {
		if (b&i) res = res*aux%mod;
		aux = aux*aux%mod;
	}
	return res;
}

int n, s[mxn], pw[2*mxn], ip[2*mxn], hv[mxn+2];
vector<int> stk;
map<array<int,2>,vector<int>> ep;
int answer[mxn];

void solve(int l, int r) {
	if (l+1 == r) {
		answer[l] = 0;
		answer[r] = 1;
		return;
	}
	int f = s[l];
	int h = hv[l];
	array<int,2> k = {f,h};
	auto it = upper_bound(all(ep[k]),r);
	--it;
	int rb = *it;
	answer[l] = 0;
	if (l+1 < rb) {
		solve(l+1,rb-1);
	}
	answer[rb] = 1;
	if (rb < r) {
		solve(rb+1,r);
	}
	return;
}

signed main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);
	
	//precompute
	pw[0] = 1, ip[0] = 1;
	for (int i=1; i<2*mxn; i++) {
		pw[i] = p*pw[i-1]%mod;
		ip[i] = ksm(p)*ip[i-1]%mod;
	}
	
	string ss; cin >> ss;
	n = sz(ss);
	for (int i=0; i<n; i++) {
		s[i] = ss[i]-'a'+1;
	}
	
	int cv=0;
	for (int i=0; i<n; i++) {
		hv[i] = cv;
		if (i && stk[sz(stk)-1]==s[i]) {
			cv -= stk[sz(stk)-1];
			cv = cv * ip[1] % mod;
			stk.pop_back();
		} else {
			stk.push_back(s[i]);
			cv = (cv * pw[1] + s[i])%mod;
		}
	}
	hv[n]=cv;
	if (cv) {
		cout<<-1; return 0;
	}
	for (int i=1; i<=n; i++) {
		if (!ep.count({s[i-1],hv[i]})) {
			ep[{s[i-1],hv[i]}] = {};
		}
		ep[{s[i-1],hv[i]}].push_back(i-1);
	}
	solve(0,n-1);
	for (int i = 0; i < n; i++) {
		cout << (answer[i] ? ')' : '(');
	}
	return 0;
}