CF946C.String Transformation

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.

给你一个由 $|s|$ 个小写英文字母组成的字符串 $s$。

在一次操作中，你可以将该字符串中的任意一个字符替换为字母表中其后继的字符（即 a 替换为 b，s 替换为 t，依此类推）。你不能将字母 z 替换为其他任何字母。

你的目标是进行若干次操作（不一定是最少次数），使得最终字符串中包含字符串 abcdefghijklmnopqrstuvwxyz（即完整的英文字母表）作为一个子序列。字符串的子序列是指通过删除原字符串中某些位置上的字符所得到的字符串。你需要输出一个由给定字符串经过若干次操作后得到的、包含英文字母表作为子序列的字符串；如果不可能实现，则说明这是不可能的。

The only one line of the input consisting of the string s consisting of |s| (1 ≤ |s| ≤ 105) small english letters.

输入仅有一行，包含一个字符串 $ s $，该字符串由 $ |s| $（$ 1 \leq |s| \leq 10^5 $）个小写英文字母组成。

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).

如果可以得到一个由给定字符串生成的字符串，且该字符串包含英文字母表（即 "abcdefghijklmnopqrstuvwxyz"）作为其子序列，则输出该字符串；否则输出 «-1»（不带引号）。