#include <bits/stdc++.h>

using namespace std;

void solve(int cs) {
  string s;
  cin >> s;
  int cnt[26] {}, n = s.size();
  for (auto &c : s) cnt[c - 'a'] += 1;
  string ans;
  while (ans.size() < n) {
    bool changed = false;
    for (int i = 0; i < 26; i++) {
      if (cnt[i] > 0 && (ans.size() == 0 || ans.back() != (i + 'a'))) {
        ans += (i + 'a');
        cnt[i] -= 1;
        int rem = n - ans.size();
        bool fail = false;
        for (int j = 0; j < 26; j++) {
          if (i != j) {
            if ((rem + 1) / 2 < cnt[j]) {
              fail = true;
              break;
            }
          } else if (cnt[j] > rem / 2) {
            fail = true;
            break;
          }
        }
        if (fail) {
          ans.pop_back();
          cnt[i] += 1;
        } else {
          changed = true;
          break;
        }
      }
    }
    if (changed == false) {
      break;
    }
  }
  if (ans.size() < n) cout << "-1\n";
  else cout << ans << "\n";
}

int32_t main() {
  cin.tie(0) -> sync_with_stdio(0);
  int t = 1;
  cin >> t;
  for (int i = 1; i <= t; i++) {
    solve(i);
  }
  return 0;
}