//In The Name Of ALLAH!
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define ld long double
#define endl '\n'
#define pb push_back
#define pf push_front
#define Zemur007 ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define bpc __builtin_popcountll
#define btz __builtin_ctzll
#define all(x) x.begin() , x.end()
#define allr(x) x.rbegin() , x.rend()
#define F first
#define S second
#define pll pair<ll , ll>
#define turtle tuple<ll , ll , ll>
#define pss pair<string , string>
#define YES cout << "YES" << endl;
#define NO cout << "NO" << endl;
#define indexed_set tree<pll , null_type , less<pll> , rb_tree_tag , tree_order_statistics_node_update>
const ll sz = 2e5 + 5 , INF = 1e18 , MOD = 1e9 + 7;
ll mask , i , j , l , k;
void solve(){
string s , ans = ""; cin >> s;
stack<ll> st;
for(i = 0 ; i < s.size() ; i++){
if(!st.empty() && s[st.top()] == s[i]) st.pop();
else st.push(i);
}
if(!st.empty()){
cout << -1 << endl;
return;
}
while(!st.empty()) st.pop();
for(i = 0 ; i < s.size() ; i++){
stack<ll> stt = st;
stt.push(i);
for(j = i + 1 ; j < s.size() ; j++){
if(!stt.empty() && s[stt.top()] == s[j]) stt.pop();
else stt.push(j);
}
if(!stt.empty()){
ans += ')';
st.pop();
}
else{
ans += '(';
st.push(i);
}
}
cout << ans << endl;
}
signed main(){
Zemur007;
//open;
ll t = 1;
// cin >> t;
while(t--){
solve();
}
// for(ll testcase = 1 ; testcase <= t ; testcase++){
// cout << "Case " << testcase << ":" << endl;
// solve();
// }
}
