#include <bits/stdc++.h>
using namespace std;

void solve() {
    string s; cin >> s;
    int n = s.size();
    int frq[26]{};
    for (int i = 0; i < n; i++) {
        frq[s[i] - 'a']++;
    }
    int prev = -1;
    for (int len = n; len >= 1; len--) {
        int mx = *max_element(frq, frq + 26);
        if (2*mx - 1 > len) {
            cout << "-1\n";
            return;
        }
        if (2*mx - 1 == len) {
            char c = max_element(frq, frq + 26) - frq;
            cout << char('a' + c);
            frq[c]--;
            prev = c;
        } else {
            int i = 0;
            while (frq[i] == 0 || i == prev)
                i++;
            cout << char('a' + i);
            frq[i]--;
            prev = i;
        }
    }
    cout << "\n";
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t; cin >> t; while (t--)
        solve();
}