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
#include<cstdio>
#include<algorithm> 
#include<cstring>
#define LL long long
using namespace std;
const int N=30;
int n,id,t[30];
char s[N];
int main()
{
	scanf("%s",s+1);
	n=strlen(s+1);
	for(int i=1;i<=n;i++)t[s[i]-'a']++;
	if(n<26)
	{
		for(int i=1;i<=n;i++)putchar(s[i]);
		for(int i=0;i<26;i++)
			if(!t[i]){putchar(i+'a');break;}
		return 0;
	}
	t[s[n]-'a']--;
	for(int i=n-1;i>=1;i--)
		if(s[i]<s[i+1]){id=i;break;}
		else t[s[i]-'a']--;
	if(!id){printf("-1");return 0;}
	for(int i=1;i<id;i++)putchar(s[i]);
	for(int i=s[id]-'a'+1;i<26;i++)
		if(!t[i]){putchar(i+'a');break;}
	return 0;
}