////////////////////////////// Author:eldaee, coder_viper!!!!!!!!!!!!!!!!!!!!!!!!11
#pragma GCC optimize ("Ofast")
#include <bits/stdc++.h>
#define int long long
#define str string
#define vec vector
#define dou double
#define ld long double
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define YES cout << "YES" << '\n'
#define Yes cout << "Yes" << '\n'
#define NO cout << "NO" << '\n'
#define No cout << "No" << '\n'
#define gcd __gcd
#define all(x) x.begin(),x.end()
#define eldaee ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
/*
*/
using namespace std;
void solve() {
str s;
cin >> s;
int n = s.size();
int cnt[26] = {0};
for (int i = 0; i < n; i++) {
cnt[s[i]-'a']++;
}
for (int i = 0; i < 26; i++) {
if (cnt[i] % 2 != 0) {
cout << -1 << "\n";
return;
}
}
str l;
char x[100000];
int y = 0;
for (int i = 0; i < n; i++) {
char c = s[i];
if (y > 0 && x[y - 1] == c) {
l += ')';
y--;
}
else {
l += '(';
x[y++] = c;
}
}
if (y != 0) {
cout << -1 << "\n";
}
else {
cout << l << "\n";
}
}
signed main()
{
eldaee
solve();
}
