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

void solve();

int main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    int tc; cin >> tc;
    for (int tt = 0; tt < tc; tt++) solve();
    return 0;
}

void solve() {
    string s; cin >> s;
    vector<int> freq(26, 0);
    for (char c : s) freq[c - 'a']++;
    int n = s.size();
    if (*max_element(freq.begin(), freq.end()) > (n + 1) / 2) {
        cout << -1 << "\n";
        return;
    }
    string ret;
    for (int i = 0, prev = -1; i < n; i++) {
        int idx = max_element(freq.begin(), freq.end()) - freq.begin();
        if (freq[idx] * 2 - 1 == n - i) {
            ret += 'a' + idx;
            freq[idx]--;
            prev = idx;
        } else {
            for (int j = 0; j < 26; j++) {
                if (freq[j] > 0 && prev != j) {
                    ret += 'a' + j;
                    freq[j]--;
                    prev = j;
                    break;
                }
            }
        }
    }
    cout << ret << "\n";
}