详解complete the word

ZS the Coder loves to read the dictionary. He thinks that a word is nice if there exists a substring (contiguous segment of letters) of it of length 26 where each letter of English alphabet appears exactly once. In particular, if the string has length strictly less than 26, no such substring exists and thus it is not nice.

Now, ZS the Coder tells you a word, where some of its letters are missing as he forgot them. He wants to determine if it is possible to fill in the missing letters so that the resulting word is nice. If it is possible, he needs you to find an example of such a word as well. Can you help him?

Input

The first and only line of the input contains a single string s (1 ≤ |s| ≤ 50 000), the word that ZS the Coder remembers. Each character of the string is the uppercase letter of English alphabet ('A'-'Z') or is a question mark ('?'), where the question marks denotes the letters that ZS the Coder can't remember.

Output

If there is no way to replace all the question marks with uppercase letters such that the resulting word is nice, then print  - 1 in the only line.

Otherwise, print a string which denotes a possible nice word that ZS the Coder learned. This string should match the string from the input, except for the question marks replaced with uppercase English letters.

If there are multiple solutions, you may print any of them.

Examples

Input

ABC??FGHIJK???OPQR?TUVWXY?

Output

ABCDEFGHIJKLMNOPQRZTUVWXYS

Input

WELCOMETOCODEFORCESROUNDTHREEHUNDREDANDSEVENTYTWO

Output

-1

Input

??????????????????????????

Output

MNBVCXZLKJHGFDSAQPWOEIRUYT

Input

AABCDEFGHIJKLMNOPQRSTUVW??M

Output

-1

Note

In the first sample case, ABCDEFGHIJKLMNOPQRZTUVWXYS is a valid answer beacuse it contains a substring of length 26 (the whole string in this case) which contains all the letters of the English alphabet exactly once. Note that there are many possible solutions, such as ABCDEFGHIJKLMNOPQRSTUVWXYZ or ABCEDFGHIJKLMNOPQRZTUVWXYS.

In the second sample case, there are no missing letters. In addition, the given string does not have a substring of length 26 that contains all the letters of the alphabet, so the answer is  - 1.

In the third sample case, any string of length 26 that contains all letters of the English alphabet fits as an answer.

ZS编码器爱读字典。他认为，如果存在一个串字是好的（字母相邻段）的长度为26个字母的英文字母出现一次。特别是，如果字符串的长度小于26，不存在这样的子串，因此它是不好的。


现在，ZS编码器告诉你一句话，在它的一些信件丢失他忘了他们。他想确定是否有可能填入缺少的字母，这样结果词就很好了。如果可能的话，他也需要你找到这样一个词的例子。你能帮助他吗？


输入
第一，输入只有一行，包含一个字符串S（1 ≤ |的| ≤ 50 000），字，ZS编码器记得。字符串的每个字符是英文字母的大写字母（A—Z）或是一个问号（“？”），其中问号表示ZS编码器不能记住字母。


输出
如果没有办法与大写字母这样的词是很好的替代所有的问号，然后打印 - 1唯一的线。


否则，打印是可能的好词，ZS编码器到字符串。除了输入大写英文字母的问号外，此字符串应与输入字符串匹配。


如果有多个解决方案，您可以打印其中任何一个。


实例
输入
ABC吗？？fghijk？？？OPQR？tuvwxy？
输出
abcdefghijklmnopqrztuvwxys
输入
welcometocodeforcesroundthreehundredandseventytwo
输出
- 1
输入
？？？？？？？？？？？？？？？？？？？？？？？？？？
输出
mnbvcxzlkjhgfdsaqpwoeiruyt
输入
aabcdefghijklmnopqrstuvw？？M
输出
- 1
注
在第一个案例的话，abcdefghijklmnopqrztuvwxys是一个有效的答案因为它包含子串的长度为26（在这种情况下，整个字符串），包含了所有的字母恰好一次。值得注意的是，有许多可能的解决方案，如有或abcedfghijklmnopqrztuvwxys。


在第二个示例示例中，没有丢失的字母。此外，给定字符串没有一个子字符串的长度为26，包含了所有的字母，所以答案是 - 1。

在第三个例子中，任何包含英语字母所有字母的长度为26的字符串都可以作为回答。

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <queue>
#include <map>
using namespace std;
char s[100011];
int visit[30];
int main()
{
    int i , j, k;
    int f, ff;
    cin>>s;
    int h = strlen( s );
    if( h < 26 )
    {
            printf("-1\n");
            return 0;
    }
         ff = 0;
        for( i =  0; i<h-25; i++)
        {
            memset( visit, 0, sizeof( visit ));
            f = 1;
            for( j  =i ;j<i+26; j++)
            {
                if( s[j] == '?')
                    continue;
                else
                    visit[s[j]-'A']++;
                if( visit[s[j]-'A']>=2 )
                {
                    f = 0;
                    break;
                }
            }
           if( f == 1)
         {
             ff = 1;
             for( j = i; j<i+26; j++)
            {
                 if( s[j] == '?')
                {
                        for( k = 0; k<26; k++)
                    {
                            if( !visit[k])
                            {
                                visit[k] = 1;
                                s[j] = k+'A';
                                break;
                            }
                    }
                }
            }
            if( ff == 1)
                break;
        }
        }
        if( ff == 1)
        {
          for ( i = 0 ; i < h ; i++)
            if (s[i] == '?')
                s[i] = 'A';
          printf ("%s\n",s);
       }
        else
        printf("-1\n");

}