Problem:
Score : 300 points

Problem Statement

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.

Sample Input 1

atcoder

Sample Output 1

atcoderb

atcoderb is the lexicographically smallest diverse word that is lexicographically larger than atcoder. Note that atcoderb is lexicographically smaller than b.

Sample Input 2

abc

Sample Output 2

abcd

Sample Input 3

zyxwvutsrqponmlkjihgfedcba

Sample Output 3

-1

This is the lexicographically largest diverse word, so the answer is -1.

Sample Input 4

abcdefghijklmnopqrstuvwzyx

Sample Output 4

abcdefghijklmnopqrstuvx

Solution in C (GCC 9.2.1) (judge verdict: Accepted)

#include <stdio.h>

int main(void) {
	char S[32];
	char aru[26] = {0};
	int i;
	if (scanf("%31s", S) != 1) return 1;
	for (i = 0; S[i] != '\0'; i++) {
		int idx = S[i] - 'a';
		if (0 <= idx && idx < 26) {
			aru[idx] = 1;
		} else {
			puts("invalid char");
			return 2;
		}
	}
	if (i < 26) {
		int j;
		for (j = 0; j < 26; j++) {
			if (!aru[j]) {
				S[i] = 'a' + j;
				S[i + 1] = '\0';
				puts(S);
				return 0;
			}
		}
		puts("ERROR!");
		return 2;
	} else {
		int aru2 = 0;
		for (i = 25; i >= 0; i--) {
			int idx = S[i] - 'a';
			if (aru2 >> idx) {
				/* 今の文字より後の文字がある */
				int j;
				for (j = idx + 1; j < 26; j++) {
					if ((aru2 >> j) & 1) {
						S[i] = 'a' + j;
						S[i + 1] = '\0';
						puts(S);
						return 0;
					}
				}
				puts("ERROR!!");
				return 2;
			}
			aru2 |= 1 << idx;
		}
		puts("-1");
		return 0;
	}
}