using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace Váltakozó{
    class Program{
        static void Main(){
            /*string str = Console.ReadLine()
            int N = str.Length;
            int[] C = new int[26];
            int e = 0, l = 0;
            foreach (int i in str) C[i - 97]++;

            string o1 = "";

            if(C.Max() > N/2){
                Console.WriteLine(-1);
                return;
            }

            for (int i=0, last = -1; l != N; i++){
                if (i > 25) for(int j=l-1; l!= N && j>0; j--){
                    if(o1[j] != C.Max() && o1[j-1] != C.Max()){
                            o1 = o1.Substring(0, j) + (char)(C.Max()+97) + o1.Substring(j);
                            C[Array.IndexOf(C, C.Max())]--;
                            l++;
                    }
                }else
                if(C[i] > 0 && last != i){
                    C[i]--;
                    l++;
                    o1 += (char)(i + 97);
                    last = i;
                    i = e - 1;
                }else{
                    
                }
            }
            Console.WriteLine(o1);
            */

            string str = Console.ReadLine();
            int N = str.Length;
            int[] C = new int[26];
            foreach (int i in str) C[i - 97]++;
            int max = C.Max(), last = -1;
            
            if(max > N / 2) {
                Console.WriteLine(-1); return;
            }

            string o1 = "";
            for(int i=N, j; i>0; i--){
                max = C.Max();
                for(j=0; j<26; j++){
                    if(C[j]>0 && last != j) if( max <= i/2 || max == C[j] ){

                        C[j]--;
                        o1 += (char)(j + 97);
                        last = j;
                        break;
                    }
                }
            }
            Console.WriteLine(o1);
        }
    }
}