{"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 You heart broke into pieces.My string broke into pieces.But you will recover one day,and my string will never go back.\u003cbr\u003e Given a string s.We can erase a subsequence of it if this subsequence is palindrome in one step. \u003cstrong\u003eWe should take as few steps as possible to erase the whole sequence.\u003c/strong\u003eHow many steps do we need?\u003cbr\u003e For example, we can erase abcba from axbyczbea and get xyze in one step.\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":" The first line contains integer T,denote the number of the test cases. Then T lines follows,each line contains the string s (1\u0026lt;\u003d length of s \u0026lt;\u003d 16).\u003cbr\u003e T\u0026lt;\u003d10."}},{"title":"Output","value":{"format":"HTML","content":"For each test cases,print the answer in a line."}},{"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\naa\r\nabb\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e1\r\n2\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}