{"trustable":false,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript type\u003d\"text/javascript\" async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS_HTML-full\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"Azzam and Seif are friends who enjoy reading the dictionary. Azzam defines a word as \"nice\" if it contains a substring (a contiguous segment of letters) of length 26 where each letter of the English alphabet appears exactly once. However, if a word has a length shorter than 26, it is not possible for it to contain such a substring, and therefore, it is not considered \"nice.\"\u003cbr/\u003e\u003cbr/\u003e\n\nAzzam challenges Seif by giving him a word, but unfortunately, Azzam doesn\u0027t remember the complete word. Some letters are missing. Seif can replace any letter in the positions of the missing letters to make it a \"nice\" word.\u003cbr/\u003e\u003cbr/\u003e\n\nCan Seif form a \"nice\" word? If he can, please print an example of such a word. If there are multiple Solutions, you can print any one of them. If Seif cannot form a \"nice\" word, please print \"-1\". \n"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eThe first and only line of the input contains a single string \u003cspan class\u003d\"tex-span\"\u003e\u003ci\u003es\u003c/i\u003e\u003c/span\u003e (\u003cspan class\u003d\"tex-span\"\u003e1 ≤ |\u003ci\u003es\u003c/i\u003e| ≤ 50 000\u003c/span\u003e), the word that Azzam remembers. Each character of the string is the uppercase letter of English alphabet (\u0027A\u0027-\u0027Z\u0027) or is a question mark (\u0027?\u0027), where the question marks denotes the letters that Azzam can\u0027t remember.\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003eIf there is no way to replace all the question marks with \u003cspan class\u003d\"tex-font-style-bf\"\u003euppercase letters\u003c/span\u003e such that the resulting word is nice, then print \u003cspan class\u003d\"tex-span\"\u003e - 1\u003c/span\u003e in the only line.\u003c/p\u003e\n\u003cp\u003eOtherwise, print a string which denotes a possible nice word that Seif formed. This string should match the string from the input, except for the question marks replaced with uppercase English letters.\u003c/p\u003e\n\u003cp\u003eIf there are multiple solutions, you may print any of them.\u003c/p\u003e"}},{"title":"Sample 1","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003eABC??FGHIJK???OPQR?TUVWXY?\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eABCDEFGHIJKLMNOPQRZTUVWXYS\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Sample 2","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003eWELCOMETOCODEFORCESROUNDTHREEHUNDREDANDSEVENTYTWO\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e-1\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Sample 3","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e??????????????????????????\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eMNBVCXZLKJHGFDSAQPWOEIRUYT\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Sample 4","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003eAABCDEFGHIJKLMNOPQRSTUVW??M\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e-1\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Note","value":{"format":"HTML","content":"\u003cp\u003eIn the first sample case, \u003cspan class\u003d\"tex-font-style-tt\"\u003eABCDEFGHIJKLMNOPQRZTUVWXYS\u003c/span\u003e is a valid answer beacuse it contains a substring of length \u003cspan class\u003d\"tex-span\"\u003e26\u003c/span\u003e (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 \u003cspan class\u003d\"tex-font-style-tt\"\u003eABCDEFGHIJKLMNOPQRSTUVWXYZ\u003c/span\u003e or \u003cspan class\u003d\"tex-font-style-tt\"\u003eABCEDFGHIJKLMNOPQRZTUVWXYS\u003c/span\u003e.\u003c/p\u003e\n\u003cp\u003eIn the second sample case, there are no missing letters. In addition, the given string does not have a substring of length \u003cspan class\u003d\"tex-span\"\u003e26\u003c/span\u003e that contains all the letters of the alphabet, so the answer is \u003cspan class\u003d\"tex-span\"\u003e - 1\u003c/span\u003e.\u003c/p\u003e\n\u003cp\u003eIn the third sample case, any string of length \u003cspan class\u003d\"tex-span\"\u003e26\u003c/span\u003e that contains all letters of the English alphabet fits as an answer.\u003c/p\u003e"}}]}