description: Polycarp has a string s. Polycarp performs the following actions until the string s is empty (t is initially an empty string):
  
    * he adds to the right to the string t the string s, i.e. he does t = t + s, where t + s is a concatenation of the strings t and s; 
    * he selects an arbitrary letter of s and removes from s all its occurrences (the selected letter must occur in the string s at the moment of performing this action). 
  
  
  
  Polycarp performs this sequence of actions strictly in this order.
  
  Note that after Polycarp finishes the actions, the string s will be empty and the string t will be equal to some value (that is undefined and depends on the order of removing).
  
  E.g. consider s="abacaba" so the actions may be performed as follows:
  
    * t="abacaba", the letter 'b' is selected, then s="aacaa"; 
    * t="abacabaaacaa", the letter 'a' is selected, then s="c"; 
    * t="abacabaaacaac", the letter 'c' is selected, then s="" (the empty string). 
  
  
  
  You need to restore the initial value of the string s using only the final value of t and find the order of removing letters from s.
  
  Input
  
  The first line contains one integer T (1 ≤ T ≤ 10^4) — the number of test cases. Then T test cases follow.
  
  Each test case contains one string t consisting of lowercase letters of the Latin alphabet. The length of t doesn't exceed 5 ⋅ 10^5. The sum of lengths of all strings t in the test cases doesn't exceed 5 ⋅ 10^5.
  
  Output
  
  For each test case output in a separate line:
  
    * -1, if the answer doesn't exist; 
    * two strings separated by spaces. The first one must contain a possible initial value of s. The second one must contain a sequence of letters — it's in what order one needs to remove letters from s to make the string t. E.g. if the string "bac" is outputted, then, first, all occurrences of the letter 'b' were deleted, then all occurrences of 'a', and then, finally, all occurrences of 'c'. If there are multiple solutions, print any one. 
  
  Example
  
  Input
  
  
  7
  abacabaaacaac
  nowyouknowthat
  polycarppoycarppoyarppyarppyrpprppp
  isi
  everywherevrywhrvryhrvrhrvhv
  haaha
  qweqeewew
  
  
  Output
  
  
  abacaba bac
  -1
  polycarp lcoayrp
  is si
  everywhere ewyrhv
  -1
  -1
  
  Note
  
  The first test case is considered in the statement.
solution: import java.util.*;
  import java.io.*;
  // import java.lang.*;
  // import java.math.*;
  
  public class Codeforces {
      static FastReader sc=new FastReader();
  	static PrintWriter out=new PrintWriter(System.out);
  	static long mod=1000000007;
  	// static long mod=998244353;
  	static int MAX=Integer.MAX_VALUE;
  	static int MIN=Integer.MIN_VALUE;
  	static long MAXL=Long.MAX_VALUE;
  	static long MINL=Long.MIN_VALUE;
  	static ArrayList<Integer> graph[];
  	public static void main (String[] args) throws java.lang.Exception
  	{
  		// code goes here
  		int t=I();
  		outer:while(t-->0)
  		{
  			String s=S();
  			char c[]=s.toCharArray();
  			int n=c.length;
  			int freq[]=new int[26];
  			for(int i=0;i<n;i++){
  				freq[c[i]-'a']++;
  			}
  			ArrayList<Integer> arr=new ArrayList<>();
  			int mask=0;
  			for(int i=n-1;i>=0;i--){
  				int b=c[i]-'a';
  				if((mask & (1<<b))==0){
  					arr.add(b);
  					mask=mask | (1<<b);
  				}
  			}
  			Collections.reverse(arr);
  			int pre[]=new int[26];
  			ArrayList<Integer> res=new ArrayList<>();
  			for(int i=0;i<n;i++){
  				pre[c[i]-'a']++;
  				boolean flag=true;
  				for(int j=0;j<arr.size();j++){
  					int q=arr.get(j);
  					if(pre[q]>0 && freq[q]%pre[q]==0 && freq[q]/pre[q]==j+1);
  					else{
  						flag=false;
  					}
  				}
  				if(flag){
  					res.add(i);
  				}
  			}
  			if(res.size()==0){
  				out.println("-1");
  			}else{
  				for(int i:res){
  					StringBuffer sb=new StringBuffer(s.substring(0,i+1));
  					char chr[]=s.substring(0,i+1).toCharArray();
  					for(int j:arr){
  						StringBuffer temp=new StringBuffer();
  						for(char ch:chr){
  							if(ch!=j+'a')temp.append(ch);
  						}
  						sb.append(temp);
  						chr=temp.toString().toCharArray();
  					}
  					if(sb.toString().equals(s)){
  						out.print(s.substring(0,i+1)+" ");
  						for(int j:arr){
  							out.print((char)(j+'a'));
  						}
  						out.println();
  						continue outer;
  					}
  				}
  				out.println("-1");
  			}
  		}
  		out.close();
  	}
  	public static class pair
      {
      	int a;
      	int b;
      	public pair(int val,int index)
      	{
      	    a=val;
      	    b=index;
      	}
      }
  	public static class myComp implements Comparator<pair>
  	{
  		//sort in ascending order.
  		public int compare(pair p1,pair p2)
  		{
  			if(p1.a==p2.a)
      	    return 0;
      	    else if(p1.a<p2.a)
      	    return -1;
      	    else
      	    return 1;
  		}
  		//sort in descending order.
  		// public int compare(pair p1,pair p2)
      	// {
      	//     if(p1.a==p2.a)
      	//     return 0;
      	//     else if(p1.a<p2.a)
      	//     return 1;
      	//     else
      	//     return -1;
      	// }
  	}
  	public static long kadane(long a[],int n)
  	{
  		long max_sum=Long.MIN_VALUE,max_end=0;
  		for(int i=0;i<n;i++){
  			max_end+=a[i];
  			if(max_sum<max_end){max_sum=max_end;}
  			if(max_end<0){max_end=0;}
  		}
  		return max_sum;
  	}
  	public static void DFS(int s,boolean visited[])
  	{
  		visited[s]=true;
  		for(int i:graph[s]){
  			if(!visited[i]){
  				DFS(i,visited);
  			}
  		}
  	}
  	public static void setGraph(int n,int m)
  	{
  		graph=new ArrayList[n+1];
  		for(int i=0;i<=n;i++){
  			graph[i]=new ArrayList<>();
  		}
  		for(int i=0;i<m;i++){
  			int u=I(),v=I();
  			graph[u].add(v);
  			graph[v].add(u);
  		}
  	}
  	public static int BS(long a[],long x,int ii,int jj)
  	{
  		// int n=a.length;
  		int mid=0;
  		int i=ii,j=jj;
  		while(i<=j)
  		{
  			mid=(i+j)/2;
  			if(a[mid]<x){
  				i=mid+1;
  			}else if(a[mid]>x){
  				j=mid-1;
  			}else{
  				return mid;
  			}
  		}
  		return -1;
  	}
  	public static int lower_bound(int arr[],int s, int N, int X)
  	{
  		if(arr[N]<X)return N;
  		if(arr[0]>X)return -1;
  		int left=s,right=N;
  		while(left<right){
  			int mid=(left+right)/2;
  			if(arr[mid]==X)
  			return mid;
  			else if(arr[mid]>X){
  				if(mid>0 && arr[mid]>X && arr[mid-1]<=X){
  					return mid-1;
  				}else{
  					right=mid-1;
  				}
  			}else{
  				if(mid<N && arr[mid+1]>X && arr[mid]<=X){
  					return mid;
  				}else{
  					left=mid+1;
  				}
  			}
  		}
  		return left;
  	}
  	public static ArrayList<Integer> primeSieve(int n)
  	{
  	    ArrayList<Integer> arr=new ArrayList<>();
  	    boolean prime[] = new boolean[n + 1];
          for (int i = 0; i <= n; i++)
          prime[i] = true;
          for (int p = 2; p * p <= n; p++)
          {
              if (prime[p] == true)
              {
                  for (int i = p * p; i <= n; i += p)
                  prime[i] = false;
              }
          }
          for (int i = 2; i <= n; i++)
          {
              if (prime[i] == true)
              arr.add(i);
          }
          return arr;
  	}
  
  	// Fenwick / BinaryIndexed  Tree  USE IT - FenwickTree ft1=new FenwickTree(n);
  	public static class FenwickTree
  	{
  		int farr[];
  		int n;
  		public FenwickTree(int c)
  		{
  			n=c+1;
  			farr=new int[n];
  		}
  		// public void update_range(int l,int r,long p)
  		// {
  		// 	update(l,p);
  		// 	update(r+1,(-1)*p);
  		// }
  		public void update(int x,int p)
  		{
  			for(;x<=n;x+=x&(-x))
  			{
  				farr[x]+=p;
  			}
  		}
  		public long get(int x)
  		{
  			long ans=0;
  			for(;x>0;x-=x&(-x))
  			{
  				ans=ans+farr[x];
  			}
  			return ans;
  		}
  	}
  
  	//Disjoint Set Union
  	public static class DSU
  	{
  	    int par[],rank[];
  	    public DSU(int c)
  	    {
  	        par=new int[c+1];
  	        rank=new int[c+1];
  	        for(int i=0;i<=c;i++)
  	        {
  	            par[i]=i;
  	            rank[i]=0;
  	        }
  	    }
  	    public int find(int a)
  	    {
  	        if(a==par[a])
  	        return a;
  	        return par[a]=find(par[a]);
  	    }
  	    public void union(int a,int b)
  	    {
  	        int a_rep=find(a),b_rep=find(b);
  	        if(a_rep==b_rep)
  	        return;
  	        if(rank[a_rep]<rank[b_rep])
  	        par[a_rep]=b_rep;
  	        else if(rank[a_rep]>rank[b_rep])
  	        par[b_rep]=a_rep;
  	        else
  	        {
  	            par[b_rep]=a_rep;
  	            rank[a_rep]++;
  	        }
  	    }
  	}
  
  	//SEGMENT TREE CODE
  
  	// public static void segmentUpdate(int si,int ss,int se,int qs,int qe,long x)
  	// {
  	// 	if(ss>qe || se<qs)return;
  	// 	if(qs<=ss && qe>=se)
  	// 	{
  	// 		seg[si][0]+=1L;
  	// 		seg[si][1]+=x*x;
  	// 		seg[si][2]+=2*x;
  	// 		return;
  	// 	}
  	// 	int mid=(ss+se)/2;
  	// 	segmentUpdate(2*si+1,ss,mid,qs,qe,x);
  	// 	segmentUpdate(2*si+2,mid+1,se,qs,qe,x);
  	// }
  	// public static long segmentGet(int si,int ss,int se,int x,long f,long s,long t,long a[])
  	// {
  	// 	if(ss==se && ss==x)
  	// 	{
  	// 		f+=seg[si][0];
  	// 		s+=seg[si][1];
  	// 		t+=seg[si][2];
  	// 		long ans=a[x]+(f*((long)x+1L)*((long)x+1L))+s+(t*((long)x+1L));
  	// 		return ans;
  	// 	}
  	// 	int mid=(ss+se)/2;
  	// 	if(x>mid){
  	// 		return segmentGet(2*si+2,mid+1,se,x,f+seg[si][0],s+seg[si][1],t+seg[si][2],a);
  	// 	}else{
  	// 		return segmentGet(2*si+1,ss,mid,x,f+seg[si][0],s+seg[si][1],t+seg[si][2],a);
  	// 	}
  	// }
  
  	
      public static class myComp1 implements Comparator<pair1>
      {
  		//sort in ascending order.
      	public int compare(pair1 p1,pair1 p2)
      	{
      	    if(p1.a==p2.a)
      	    return 0;
      	    else if(p1.a<p2.a)
      	    return -1;
      	    else
      	    return 1;
      	}
  		//sort in descending order.
  		// public int compare(pair p1,pair p2)
      	// {
      	//     if(p1.a==p2.a)
      	//     return 0;
      	//     else if(p1.a<p2.a)
      	//     return 1;
      	//     else
      	//     return -1;
      	// }
      }
  	public static class pair1
      {
      	long a;
      	long b;
  		int p;
      	public pair1(long val,long index,int i)
      	{
      	    a=val;
      	    b=index;
  			p=i;
      	}
      }
      public static ArrayList<pair1> mergeIntervals(ArrayList<pair1> arr)
  	{
  	    //****************use this in main function-Collections.sort(arr,new myComp1());
  	    ArrayList<pair1> a1=new ArrayList<>();
  	    if(arr.size()<=1)
  	    return arr;
  	    a1.add(arr.get(0));
  	    int i=1,j=0;
  	    while(i<arr.size())
  	    {
  	        if(a1.get(j).b<arr.get(i).a)
  	        {
  	           a1.add(arr.get(i));
  	           i++;
  	           j++;
  	        }
  	        else if(a1.get(j).b>arr.get(i).a && a1.get(j).b>=arr.get(i).b)
  	        {
  	            i++;
  	        }
  	        else if(a1.get(j).b>=arr.get(i).a)
  	        {
  	            long a=a1.get(j).a;
  	            long b=arr.get(i).b;
  	            a1.remove(j);
  	            a1.add(new pair1(a,b,-1));
  	            i++;
  	        }
  	    }
  	    return a1;
  	}
  	public static boolean isPalindrome(String s,int n)
  	{
  		for(int i=0;i<=n/2;i++){
  			if(s.charAt(i)!=s.charAt(n-i-1)){
  				return false;
  			}
  		}
  		return true;
  	}
  	public static int gcd(int a,int b)
  	{
  	    if(b==0)
  	    return a;
  	    else
  	    return gcd(b,a%b);
  	}
  	public static long gcd(long a,long b)
  	{
  	    if(b==0)
  	    return a;
  	    else
  	    return gcd(b,a%b);
  	}
  	public static long fact(long n)
  	{
  		long fact=1;
  		for(long i=2;i<=n;i++){
  			fact=((fact%mod)*(i%mod))%mod;
  		}
  		return fact;
  	}
  	public static long fact(int n)
  	{
  		long fact=1;
  		for(int i=2;i<=n;i++){
  			fact=((fact%mod)*(i%mod))%mod;
  		}
  		return fact;
  	} 
  	public static boolean isPrime(int n) 
  	{ 
  	    if (n <= 1) 
  	        return false; 
  	    if (n <= 3) 
  	        return true; 
  	    if (n % 2 == 0 || n % 3 == 0) 
  	        return false; 
  	    double sq=Math.sqrt(n);
  	  
  	    for (int i = 5; i <= sq; i = i + 6) 
  	        if (n % i == 0 || n % (i + 2) == 0) 
  	            return false; 
  	    return true; 
  	} 
      public static boolean isPrime(long n) 
  	{ 
  	    if (n <= 1) 
  	        return false; 
  	    if (n <= 3) 
  	        return true; 
  	    if (n % 2 == 0 || n % 3 == 0) 
  	        return false; 
  	    double sq=Math.sqrt(n);
  	
  	    for (int i = 5; i <= sq; i = i + 6) 
  	        if (n % i == 0 || n % (i + 2) == 0) 
  	            return false; 
  	    return true; 
  	}
  	public static void printArray(long a[])
  	{
  		for(int i=0;i<a.length;i++){
  			out.print(a[i]+" ");
  		}
  		out.println();
  	}
  	public static void printArray(int a[])
  	{
  		for(int i=0;i<a.length;i++){
  			out.print(a[i]+" ");
  		}
  		out.println();
  	}
  	public static void printArray(char a[])
  	{
  		for(int i=0;i<a.length;i++){
  			out.print(a[i]);
  		}
  		out.println();
  	}
  	public static void printArray(String a[])
  	{
  		for(int i=0;i<a.length;i++){
  			out.print(a[i]+" ");
  		}
  		out.println();
  	}
  	public static void printArray(boolean a[])
  	{
  		for(int i=0;i<a.length;i++){
  			out.print(a[i]+" ");
  		}
  		out.println();
  	}
  	public static void printArray(int a[][])
  	{
  		for(int i=0;i<a.length;i++){
  			for(int j=0;j<a[i].length;j++){
  				out.print(a[i][j]+" ");
  			}out.println();
  		}
  	}
  	public static void printArray(long a[][])
  	{
  		for(int i=0;i<a.length;i++){
  			for(int j=0;j<a[i].length;j++){
  				out.print(a[i][j]+" ");
  			}out.println();
  		}
  	}
  	public static void printArray(char a[][])
  	{
  		for(int i=0;i<a.length;i++){
  			for(int j=0;j<a[i].length;j++){
  				out.print(a[i][j]+" ");
  			}out.println();
  		}
  	}
  	public static void printArrayL(ArrayList<Long> arr)
  	{
  		for(int i=0;i<arr.size();i++){
  			out.print(arr.get(i)+" ");
  		}
  		out.println();
  	}
  	public static void printArrayI(ArrayList<Integer> arr)
  	{
  		for(int i=0;i<arr.size();i++){
  			out.print(arr.get(i)+" ");
  		}
  		out.println();
  	}
  	public static void printArrayS(ArrayList<String> arr)
  	{
  		for(int i=0;i<arr.size();i++){
  			out.print(arr.get(i)+" ");
  		}
  		out.println();
  	}
  	public static void printMapInt(HashMap<Integer,Integer> hm){
  		for(Map.Entry<Integer,Integer> e:hm.entrySet()){
  			out.println(e.getKey()+"->"+e.getValue());
  		}out.println();
  	}
  	public static void printMapLong(HashMap<Long,Long> hm){
  		for(Map.Entry<Long,Long> e:hm.entrySet()){
  			out.println(e.getKey()+"->"+e.getValue());
  		}out.println();
  	}
  
  	//Modular Arithmetic
  
  	public static long add(long a,long b)
  	{
  		a+=b;
  		if(a>=mod)a-=mod;
  		return a;
  	}
  	public static long sub(long a,long b)
  	{
  		a-=b;
  		if(a<0)a+=mod;
  		return a;
  	}
  	public static long mul(long a,long b)
  	{
  		return ((a%mod)*(b%mod))%mod;
  	}
  	public static long divide(long a,long b,long m)
  	{
  		a=mul(a,modInverse(b,m));
  		return a;
  	}
  	public static long modInverse(long a,long m)
  	{
  		int x=0,y=0;
  		own p=new own(x,y);
  		long g=gcdExt(a,m,p);
  		if(g!=1){
  			out.println("inverse does not exists");
  			return -1;
  		}else{
  			long res=((p.a%m)+m)%m;
  			return res;
  		}
  	}
  	public static long gcdExt(long a,long b,own p)
  	{
  		if(b==0){
  			p.a=1;
  			p.b=0;
  			return a;
  		}
  		int x1=0,y1=0;
  		own p1=new own(x1,y1);
  		long gcd=gcdExt(b,a%b,p1);
  		p.b=p1.a - (a/b) * p1.b;
  		p.a=p1.b;
  		return gcd;
  	}
  	public static long pwr(long m,long n)
  	{
  		long res=1;
  		m=m%mod;
  		if(m==0)
  		return 0;
  		while(n>0)
  		{
  			if((n&1)!=0)
  			{
  				res=(res*m)%mod;
  			}
  			n=n>>1;
  			m=(m*m)%mod;
  		}
  		return res;
  	}
  	public static class own
      {
      	long a;
      	long b;
      	public own(long val,long index)
      	{
      	    a=val;
      	    b=index;
      	}
      }
  
  	//Modular Airthmetic
  
  	public static void sort(int[] A)
  	{
          int n = A.length;
          Random rnd = new Random();
          for(int i=0; i<n; ++i)
  		{
              int tmp = A[i];
              int randomPos = i + rnd.nextInt(n-i);
              A[i] = A[randomPos];
              A[randomPos] = tmp;
          }
          Arrays.sort(A);
      }
      public static void sort(long[] A)
  	{
  	    int n = A.length;
          Random rnd = new Random();
          for(int i=0; i<n; ++i)
  		{
              long tmp = A[i];
              int randomPos = i + rnd.nextInt(n-i);
              A[i] = A[randomPos];
              A[randomPos] = tmp;
          }
  	    Arrays.sort(A);
  	}
  	public static int I(){return sc.I();}
      public static long L(){return sc.L();}
      public static String S(){return sc.S();}
      public static double D(){return sc.D();}
  }
  class FastReader {  
      BufferedReader br;
      StringTokenizer st;
      public FastReader(){
          br = new BufferedReader(new InputStreamReader(System.in));
      }
      String next(){
          while (st == null || !st.hasMoreElements()){
              try {
                  st = new StringTokenizer(br.readLine());
              }
              catch (IOException e){
                  e.printStackTrace();
              }
          }
          return st.nextToken();
      }
      int I(){ 
          return Integer.parseInt(next());
      }
      long L(){ 
          return Long.parseLong(next());
      }
      double D(){
           return Double.parseDouble(next());
      }
      String S(){
          String str = "";
          try 
          {
              str = br.readLine();
          }
          catch (IOException e)
          {
              e.printStackTrace();
          }
          return str;
      }
  }
  