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 length26 where each letter of English alphabet appears exactly once. In particular, if the string has length strictly less than26, 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, ex

cept for the question marks replaced with uppercase English letters.

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

Example

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 length26 (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 asABCDEFGHIJKLMNOPQRSTUVWXYZ orABCEDFGHIJKLMNOPQRZTUVWXYS.

In the second sample case, there are no missing letters. In addition, the given string does not have a substring of length26 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,

首先，看到这一题觉得挺复杂的但是理解做起来也不是很复杂。

第一点：他并不是说所有的字符放在一起统计26字符，而是字符串的子串来统计连续的26位

第二点：两层for循环实现字符串统计连续26字符、

第三点：对于不合适的需要连续统计测试一直到字符串的末尾，对于符合的直接输出就好，两种不同路径要分清，不同情况不同讨论。

#7965301 zhuyinghui's solution for [CodeForces-716B] [Problem A]

Status	Accepted
Time	31ms
Memory	2084kB
Length	1925
Lang	GNU G++ 5.1.0
Submitted	2017-01-21 11:22:09
Shared
RemoteRunId	24001526

Select Code

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

int main()
{
    int n;
    int i,j,k,flag=1;
    char a[50050];
    int b[26];
    while(~scanf("%s",a))
    {
        n=strlen(a);
        if(n<26)
        {
            printf("-1\n");
            continue;
        }
        else
        {
            memset(b,0,sizeof(b));//每次新的输入都是有初始化记录的
            for(i=0;i<=n-26;i++)
            {
                flag=1;
                memset(b,0,sizeof(b));//每次测试一个新的子串也需要初始化
                for(j=i;j<i+26;j++)
                {
                    if(a[j]>='A'&&a[j]<='Z')
                    {
                        b[a[j]-'A']++;
                        if(b[a[j]-'A']>1)
                        {
                            flag=0;//该测试子串不符合条件，测试下一个子串
                            break;
                        }
                    }
                }
                if(flag==0)//该测试子串不符合条件，测试下一个子串
                {
                    continue;
                }
                if(flag==1)//符合条件，根据统计的字符修改i该子串的问号
                {
                    for(j=i;j<i+26;j++)
                    {
                        if(a[j]=='?')
                        {
                            for(k=0;k<26;k++)
                            {
                                if(b[k]==0)
                                   break;
                            }
                            a[j]='A'+k;
                            b[k]++;
                        }
                    }
                    break;//全部修改后跳出循环判断字串的for循环
                }

            }
            if(i==n-25)//一旦存在合适的子串i不会到最后后的一个
            {
                printf("-1\n");
                continue;
            }
            for(i=0;i<n;i++)//排除-1的情况就把符合的修改一下然后输出
            {
                if(a[i]=='?')
                    a[i]='A';
            }
            printf("%s\n",a);
        }
    }
    return 0;
}