Problem: You are given a string s consisting of |s| small english letters.

In one move you can replace any character of this string to the next character in alphabetical order (a will be replaced with b, s will be replaced with t, etc.). You cannot replace letter z with any other letter.

Your target is to make some number of moves (not necessary minimal) to get string abcdefghijklmnopqrstuvwxyz (english alphabet) as a subsequence. Subsequence of the string is the string that is obtained by deleting characters at some positions. You need to print the string that will be obtained from the given string and will be contain english alphabet as a subsequence or say that it is impossible.

Input

The only one line of the input consisting of the string s consisting of |s| (1 ≤ |s| ≤ 105) small english letters.

Output

If you can get a string that can be obtained from the given string and will contain english alphabet as a subsequence, print it. Otherwise print «-1» (without quotes).

Examples

Input

aacceeggiikkmmooqqssuuwwyy


Output

abcdefghijklmnopqrstuvwxyz


Input

thereisnoanswer


Output

-1

Solution (in JAVA):

Solution:
import java.util.*;
import java.io.*;
import java.text.*;
public class Main{
    static FastReader in;
    static long MOD = (long)1e9+7;
    static int MAX = (int)1e6+1;
    static int IINF = (int)1e9;
    static long INF = (long)1e16;
    static double eps = 1e-8;
    static DecimalFormat df = new DecimalFormat("0.0000000000");
    public static void main(String[] args) throws Exception{
        in = new FastReader();
        StringBuilder out = new StringBuilder("");
        String s = n();
        int c = 0;
        for(int i = 0; i< s.length(); i++){
            if(s.charAt(i)-'a' <= c && c<26){
                out.append(""+(char)('a'+c));
                c++;
            }else out.append(s.charAt(i));
        }
        if(c!=26)out = new StringBuilder("-1");
        System.out.println(out.toString());
    }
    
    static boolean equal(double d1, double d2){
        return (Math.abs(d1-d2)< eps);
    }
    
    static boolean greater(double d1, double d2){
        if(equal(d1,d2))return false;
        return (d1> d2);
    }
    
    static void pn(Object o){
        System.out.println(o);
    }
    
    static String n(){
        return in.next();
    }
    
    static String nln(){
        return in.nextLine();
    }
    
    static int ni(){
        return Integer.parseInt(in.next());
    }
    
    static long nl(){
            return Long.parseLong(in.next());
    }
    
    static double nd(){
        return Double.parseDouble(in.next());
    }
    
    static class FastReader{
        BufferedReader br;
        StringTokenizer st;
        public FastReader(){
            br = new BufferedReader(new InputStreamReader(System.in));
        }
        
        public FastReader(String s) throws Exception{
            br = new BufferedReader(new FileReader(s));
        }
 
        String next(){
            while (st == null || !st.hasMoreElements()){
                try{
                    st = new StringTokenizer(br.readLine());
                }catch (IOException  e){
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
 
        String nextLine(){
            String str = "";
            try{
                str = br.readLine();
            }catch (IOException e){
                e.printStackTrace();
            }
            return str;
        }
    }
}