Problem: 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.

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;

public class B_372_div2
{
    public static final Random RANDOM = new Random(System.currentTimeMillis());
    private static BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
    private static StringTokenizer stringTokenizer = null;
    private static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));

    private static String next() throws IOException
    {
        while ((stringTokenizer == null) || (!stringTokenizer.hasMoreTokens()))
        {
            stringTokenizer = new StringTokenizer(bufferedReader.readLine());
        }
        return stringTokenizer.nextToken();
    }

    public static int nextInt() throws IOException
    {
        return Integer.parseInt(next());
    }

    public static double nextDouble() throws IOException
    {
        return Double.parseDouble(next());
    }

    public static long nextLong() throws IOException
    {
        return Long.parseLong(next());
    }

    public static String nextLine() throws IOException
    {
        return bufferedReader.readLine();
    }

    public static void close()
    {
        out.close();
    }

    public static void main(String[] args)
    {
        try
        {
            solve();
        } catch (IOException exception)
        {
            exception.printStackTrace();
        }
        close();
    }

    public static boolean solutionFound(Map<Character, Integer> character2Count, int jokers, char[] solution, int indexSolution)
    {
        boolean result = character2Count.size() + jokers == 26;
        if (result)
        {
            for (char character = 'A'; character <= 'Z'; character++)
            {
                if (!character2Count.containsKey(character))
                {
                    boolean replaced = false;
                    for (int index = indexSolution; replaced == false && index < indexSolution + 26; index++)
                    {
                        if (solution[index] == '?')
                        {
                            solution[index] = character;
                            replaced = true;
                        }
                    }
                }
            }
        }
        return result;
    }

    public static void solve() throws IOException
    {
        String s = next();
        char[] solution = new char[s.length()];
        for (int index = 0; index < s.length(); index++)
        {
            solution[index] = s.charAt(index);
        }
        Map<Character, Integer> character2Count = new TreeMap<>();
        int jokers = 0;
        for (int index = 0; index < Math.min(26, solution.length); index++)
        {
            char character = solution[index];
            if (character == '?')
            {
                jokers += 1;
            }
            else
            {
                Integer current = character2Count.getOrDefault(character, 0);
                character2Count.put(character, current + 1);
            }
        }
        boolean solutionFound = solutionFound(character2Count, jokers, solution, 0);

        for (int index = 26; !solutionFound && index < solution.length; index++)
        {
            char character = solution[index - 26];
            if (character == '?')
            {
                jokers -= 1;
            }
            else
            {
                int count = character2Count.get(character);
                if (count == 1)
                {
                    character2Count.remove(character);
                }
                else
                {
                    character2Count.put(character, count - 1);
                }
            }
            character = solution[index];
            if (character == '?')
            {
                jokers += 1;
            }
            else
            {
                Integer current = character2Count.getOrDefault(character, 0);
                character2Count.put(character, current + 1);
            }
            solutionFound = solutionFound(character2Count, jokers, solution, index - 25);
        }
        if (solutionFound)
        {
            for (int index = 0; index < solution.length; index++)
            {
                if (solution[index] == '?')
                {
                    out.print('A');
                }
                else
                {
                    out.print(solution[index]);
                }
            }
            out.println();
        }
        else
        {
            out.println(-1);
        }
    }
}