#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;

int n, s[mxn], cnt[26];


signed main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);
	
	string ss; cin >> ss;
	n = sz(ss);
	for (int i=0; i<n; i++) {
		s[i] = ss[i]-'a';
		cnt[s[i]]++;
	}
	for (int i=0; i<n; i++) {
		if (cnt[i]&1) {
			cout<<-1; return 0;
		}
	}
	vector<int> stk, brk;
	for (int i=0; i<n; i++) {
		int f = s[i];
		vector<int> stk1 = stk;
		//case 1 - insert
		stk1.push_back(f);
		for (int j=i+1; j<n; j++) {
			int cf = s[j];
			if (stk1[sz(stk1)-1]==cf) {
				stk1.pop_back();
			} else {
				stk1.push_back(cf);
			}
		}
		if (!sz(stk1)) {
			stk.push_back(f);
			brk.push_back(0);
			continue;
		}
		//case 2 - put back
		if (!sz(stk) || stk[sz(stk)-1]!=f) {
			cout<<-1; return 0;
		} else {
			stk.pop_back();
			brk.push_back(1);
		}
	}
	for (int i:brk) {
		cout << (i ? ')' : '(');
	}
	
	return 0;
}