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.*;
import java.io.*;


public class Main{

    private static final Scanner in = new Scanner(System.in);
    public static void main(String[] args) {
            char[] arr = in.next().toCharArray();

            if(arr.length == 26) {
                int[] cnt = new int[26];
                for(char c : arr) {
                    ++cnt[c - 'a'];
                }

                int ans = -1;
                int i = arr.length - 1;
                for(i = arr.length - 1; i >= 0; --i) {
                    //System.err.println(">" +i);
                    for(int j = arr[i] - 'a' + 1; j < 26; ++j) {
                       // System.err.println(">>" +j);
                        if(cnt[j] == 0) {
                            ans = j;
                            break;
                        }
                    }
                    
                    if(ans != -1) break;
                    --cnt[arr[i] - 'a'];
                }

                if(ans == -1) {
                    System.out.println(-1);
                } else {
                    for(int j = 0; j < i; ++j) {
                        System.out.print(arr[j]);
                    }

                    System.out.println((char) ('a' + ans));
                }
            } else {
                int[] cnt = new int[26];
                for(char c : arr) {
                    ++cnt[c - 'a'];
                }

                System.out.print(new String(arr));
                for(int i = 0; i < 26; ++i) {
                    if(cnt[i] == 0) {
                        System.out.println((char) ('a' + i));
                        break;
                    }
                }
            }
    }
}