{"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\"\u003eWhen shopping on Long Street, Michael usually parks his car at some random location, and then walks to the stores he needs.\u003cbr\u003eCan you help Michael choose a place to park which minimises the distance he needs to walk on his shopping round?\u003cbr\u003eLong Street is a straight line, where all positions are integer.\u003cbr\u003eYou pay for parking in a specific slot, which is an integer position on Long Street. Michael does not want to pay for more than one parking though. He is very strong, and does not mind carrying all the bags around.\u003cbr\u003e\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"The first line of input gives the number of test cases, 1 \u0026lt;\u003d t \u0026lt;\u003d 100. There are two lines for each test case. The first gives the number of stores Michael wants to visit, 1 \u0026lt;\u003d n \u0026lt;\u003d 20, and the second gives their n integer positions on Long Street, 0 \u0026lt;\u003d xi \u0026lt;\u003d 99.\u003cbr\u003e"}},{"title":"Output","value":{"format":"HTML","content":"Output for each test case a line with the minimal distance Michael must walk given optimal parking."}},{"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\n4\r\n24 13 89 37\r\n6\r\n7 30 41 14 39 42\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e152\r\n70\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}