{"trustable":false,"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":"\u003cscript type\u003d\u0027text/x-mathjax-config\u0027\u003eMathJax.Hub.Config({tex2jax: { inlineMath: [[\u0027$\u0027,\u0027$\u0027],[\u0027\\[\u0027,\u0027\\]\u0027]] } }); \u003c/script\u003e\n\u003cscript type\u003d\u0027text/javascript\u0027 src\u003d\u0027https://cdn.mathjax.org/mathjax/latest/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\u0027\u003e\u003c/script\u003e\n\u003cscript type\u003d\u0027text/javascript\u0027\u003esetTimeout(function(){MathJax.Hub.Queue([\u0027Typeset\u0027, MathJax.Hub, \u0027left_view\u0027]);}, 2000);\u003c/script\u003e\n\u003cdiv class\u003d\"panel_content\"\u003e\n A palindrome is a symmetrical string, that is, a string read identically from left to right as well as from right to left. You are to write a program which, given a string, determines the minimal number of characters to be inserted into the string in order to obtain a palindrome. \n \u003cbr\u003e \n \u003cbr\u003eAs an example, by inserting 2 characters, the string \"Ab3bd\" can be transformed into a palindrome (\"dAb3bAd\" or \"Adb3bdA\"). However, inserting fewer than 2 characters does not produce a palindrome. \n\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"Multiply test cases.Your program is to read from standard input. The first line contains one integer: the length of the input string N, 3 \u0026lt;\u003d N \u0026lt;\u003d 5000. The second line contains one string with length N. The string is formed from uppercase letters from \u0027A\u0027 to \u0027Z\u0027, lowercase letters from \u0027a\u0027 to \u0027z\u0027 and digits from \u00270\u0027 to \u00279\u0027. Uppercase and lowercase letters are to be considered distinct. \n\u003cbr\u003e"}},{"title":"Output","value":{"format":"HTML","content":"Your program is to write to standard output. The first line contains one integer, which is the desired minimal number. \n\u003cbr\u003e"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre\u003e5\nAb3bd\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre\u003e2\u003c/pre\u003e"}},{"title":"Hint","value":{"format":"HTML","content":""}}]}