#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;

signed main() {
#ifndef LOCAL
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
#else
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    string s;
    cin >> s;
    int n = (int)s.size();
    string t = s;

    vector<int> q;
    vector<int> before(n);
    vector<int> after(n);

    map<int, set<int>> Q[26];

    bitset<26> F;

    int v = 0;
    for (int i = 0; i < n; i++) {
        before[i] = F.to_ullong();
        if (!q.empty() && s[q.back()] == s[i]) {
            t[i] = ')';
            q.pop_back();
        } else {
            t[i] = '(';
            q.push_back(i);
        }
        F[s[i] - 'a'] = F[s[i] - 'a'] ^ 1;
        after[i] = F.to_ullong();
        Q[s[i] - 'a'][after[i]].insert(i);
    }

    if (!q.empty()) {
        cout << -1 << '\n';
    } else {
        auto rec = [&](auto &&rec, int l, int r) -> void {
            if (l > r) {
                return;
            }
            if (s[l] == s[r]) {
                t[l] = '(';
                t[r] = ')';
                rec(rec, l + 1, r - 1);
            } else {
                const auto &B = Q[s[l] - 'a'][before[l]];
                auto it = B.upper_bound(r);

                int best = *prev(it);

                rec(rec, l, best);
                rec(rec, best + 1, r);
            }
        };
        rec(rec, 0, n - 1);
        cout << t << '\n';
    }
    return 0;
}