Gotou just received a dictionary. However, he doesn't recognize the language used in the dictionary. He did some analysis on the dictionary and realizes that the dictionary contains all possible diverse words in lexicographical order.

A word is called diverse if and only if it is a nonempty string of English lowercase letters and all letters in the word are distinct. For example, `atcoder`, `zscoder` and `agc` are diverse words while `gotou` and `connect` aren't diverse words.

Given a diverse word S, determine the next word that appears after S in the dictionary, i.e. the lexicographically smallest diverse word that is lexicographically larger than S, or determine that it doesn't exist.

Let X = x_{1}x_{2}...x_{n} and Y = y_{1}y_{2}...y_{m} be two distinct strings. X is lexicographically larger than Y if and only if Y is a prefix of X or x_{j} > y_{j} where j is the smallest integer such that x_{j} \neq y_{j}.

Constraints

* 1 \leq |S| \leq 26
* S is a diverse word.

Input

Input is given from Standard Input in the following format:


S


Output

Print the next word that appears after S in the dictionary, or `-1` if it doesn't exist.

Examples

Input

atcoder


Output

atcoderb


Input

abc


Output

abcd


Input

zyxwvutsrqponmlkjihgfedcba


Output

-1


Input

abcdefghijklmnopqrstuvwzyx


Output

abcdefghijklmnopqrstuvx
import java.util.*;

public class Main{

    public static void main(String args[]){
        Scanner sc = new Scanner(System.in);
        
        String S = sc.next();
        sc.close();
        if(S.equals("zyxwvutsrqponmlkjihgfedcba"))
            System.out.println(-1);
        else {
            int[] c = new int[26];
            for(int i = 0; i < S.length(); i++){
                c[S.charAt(i) - 'a']++;
            }
            if(S.length() != 26){
                char C = 'a';
                for(int i = 0; i < 26; i++){
                    if(c[i] == 0){
                        C = (char)('a' + i);
                        break;
                    }
                }
                System.out.print(S);
                System.out.println(C);
            } else {
                int idx  = 25;
                while(S.charAt(idx) < S.charAt(idx-1)){
                    idx--;
                }
                for(int i = 0; i < idx-1; i++){
                    System.out.print(S.charAt(i));
                }
                char A = 'z';
                for(int i = 25; i >= idx; i--){
                    if(S.charAt(i) > S.charAt(idx-1)) {
                        A = S.charAt(i);
                        break;
                    }
                }
                System.out.println(A);
            }
        }
    }
}