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:
//package com.company;

import java.io.*;
import java.util.*;

public class Main {

    public static void main(String[] args) throws IOException {
        MyScanner sc = new MyScanner(System.in);
        PrintWriter pw = new PrintWriter(System.out);
        Task.solve(sc, pw);
        pw.close();
    }
    public static class Task {
        static int INF = (int) 1e8 + 12345;

        public static void solve(MyScanner sc, PrintWriter pw) throws IOException {
            String s= sc.next();
            int start = 'a';
            StringBuilder nstr = new StringBuilder();
            for (int i = 0; i < s.length(); i++) {
                if (s.charAt(i) <= start && start <= 'z') {
                    nstr.append((char)start);
                    start++;
                } else {
                    nstr.append(s.charAt(i));
                }
            }
            if (start > 'z') {
                pw.println(nstr.toString());
            } else {
                pw.println(-1);
            }
//           String s = sc.next();
//           int n = s.length();
//           int[][] dp = new int[n+1][27];
//           int[][] from = new int[n+1][27];
//            for (int i = 0; i < dp.length; i++) {
//                Arrays.fill(dp[i], INF);
//            }
//            dp[0][0] = 0;
//
//            for (int i = 0; i < n; i++) {
//                for (int j = 0; j <= 26; j++) {
//                    dp[i+1][j] = Math.min(dp[i+1][j], dp[i][j]);
//                    from[i+1][j] = j;
//                }
//                for (int j = 0; j < 26; j++) {
//                    if (dp[i][j] != INF) {
//                        int c = s.charAt(i) - 'a' + 1;
//                        if (c <= j + 1) {
//                            int cost = j + 1 - c;
//                            if (dp[i][j] + cost < dp[i+1][j+1]) {
//                                dp[i+1][j+1] = dp[i][j] + cost;
//                                from[i+1][j+1] = j;
//                            }
////                            dp[i+1][j+1] = Math.min(dp[i+1][j+1], dp[i][j] + cost);
//                        }
//                    }
//                }
//            }
//            if (dp[n][26] == INF) {
//                pw.println(-1);
//            } else {
//                StringBuilder
//                int start = 26;
//                for (int i = n; i >= 0; i--) {
//                    int f = from[n][start];
//                    if (f != start) {
//
//                    }
//                }
//                pw.println(dp[n][26]);
//            }
        }
    }

    public static class MyScanner {
        StringTokenizer st;
        BufferedReader br;
        public MyScanner(InputStream  s) {
            br = new BufferedReader(new InputStreamReader(s));
        }
        public MyScanner(FileReader s) throws FileNotFoundException{
            br = new BufferedReader(s);
        }
        public String next() throws IOException{
            while (st == null || !st.hasMoreTokens()) {
                st = new StringTokenizer(br.readLine());
            }
            return st.nextToken();
        }
        public int nextInt() throws IOException {
            return Integer.parseInt(next());
        }
        public long nextLong() throws IOException {
            return Long.parseLong(next());
        }
        public String nextLine() throws IOException {
            return br.readLine();
        }
        public double nextDouble() throws IOException {
            return Double.parseDouble(next());
        }
        public boolean ready() throws IOException {
            return br.ready();
        }
    }
}