#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <array>
#include <string>
#include <cstdio>
#include <iterator>
#include <unordered_set>
#include <cstdint>
#include <queue>
#include <stack>
#include <deque>
#include <numeric>
#include <fstream>
using namespace std;

template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
void dbg_out() { cout << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << ' ' << H; dbg_out(T...); }
#ifdef LOCAL
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

/*

notes:

int64_t
stoi(string s) -> string to int
to_string() -> int (or else) to string

vector declaration:
vector<ll> v(n, 0)
vector<vector<ll>> v(n, vector<ll>(n, 0));

{if statement} ? {truth value} : {false value}

set lower bound/upper bound:
 	// . . . m1 . . . d . . . . m2
    auto m1_it = b.lower_bound(d);
    advance(m1_it, -1);
    m1 = *m1_it;
	m2 = *b.upper_bound(d);

#ifdef LOCAL
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
#endif

constexpr auto lcm(auto x, auto... xs)
{
	return ((x = std::lcm(x, xs)), ...);
}

std::gcd(int a, int b)

*/

typedef long long ll;

vector<string> sr;

bool poss(string s) {

	map<string, bool> mp;

	sr.clear();

	ll n = s.length();

	string curr = s.substr(0, 1);
	for(ll i = 1; i < n; i++) {
		if(s[i-1] != s[i]) {
			//cerr << "\ncurr=" << curr;
			if(curr.length() > 3) {
				return false;
			}

			if(curr.length() == 3) {
				
				string curr1 = curr.substr(0, 2);
				string curr2 = curr.substr(2, 1);

				if(mp[curr1] == true) {
					return false;
				}else{
					mp[curr1] = true;
					sr.push_back(curr1);
				}
				if(mp[curr2] == true) {
					return false;
				}else{
					mp[curr2] = true;
					sr.push_back(curr2);
				}

			}else{
				if(mp[curr] == true) {
					return false;
				}else{
					mp[curr] = true;
					sr.push_back(curr);
				}
			}
			curr = "";
		}
		curr += s[i];
	}

	return true;

}

void solve() {

	string s;
	cin >> s;

	s += "?";

	if(poss(s)) {
		for(const auto & x : sr) {
			cout << x << " ";
		}
		cout << "\n";
	}else{
		cout << "-1\n";
	}


}

int main()
{
	std::ios_base::sync_with_stdio(false);

	ll tests = 0;
	cin >> tests;

	while(tests--)
	{
		solve();
	}

	return 0;
}