{"trustable":true,"prependHtml":"\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 async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"panel_content\"\u003e$N$ frogs from different countries are standing in a line. Each country is represented by a lowercase letter. The distance between adjacent frogs (e.g. the $1^{st}$ and the $2^{nd}$ frog, the $N - 1^{th}$ and the $N^{th}$ frog, etc) are exactly $1$. Two frogs are friends if they come from the same country.\u003cbr\u003e\u003cbr\u003eThe closest friends are a pair of friends with the \u003cb\u003eminimum\u003c/b\u003e distance. Help us find that distance.\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"First line contains an integer $T$, which indicates the number of test cases.\u003cbr\u003e\u003cbr\u003eEvery test case only contains a string with length $N$, and the $i^{th}$ character of the string indicates the country of $i^{th}$ frogs.\u003cbr\u003e\u003cbr\u003e$\\cdot$ $1 \\leq T \\leq 50$.\u003cbr\u003e\u003cbr\u003e$\\cdot$ for 80% data, $1 \\leq N \\leq 100$.\u003cbr\u003e\u003cbr\u003e$\\cdot$ for 100% data, $1 \\leq N \\leq 1000$.\u003cbr\u003e\u003cbr\u003e$\\cdot$ the string only contains lowercase letters."}},{"title":"Output","value":{"format":"HTML","content":"For every test case, you should output \"\u003cb\u003eCase #x: y\u003c/b\u003e\", where $x$ indicates the case number and counts from $1$ and $y$ is the result. If there are no frogs in same country, output $-1$ instead."}},{"title":"Sample","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\u003e2\r\nabcecba\r\nabc\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eCase #1: 2\r\nCase #2: -1\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}