{"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\"\u003eDefine the **median** of a sequence of length $n$ as:\u003cbr\u003e\u003cbr\u003eIf $n$ is odd, the **median** is the number ranked $\\lfloor \\dfrac {n+1} 2\\rfloor$ if we sort the sequence in ascending order.\u003cbr\u003e\u003cbr\u003eIf $n$ is even, the **median** is the number that has more occurences between the numbers ranked $\\lfloor \\dfrac {n} 2\\rfloor$ and $\\lfloor \\dfrac {n} 2+1\\rfloor$ if we sort the sequence in ascending order. If they appeared for the same number of times the smaller one is the **median**.\u003cbr\u003e\u003cbr\u003eDefine the **shikness** of a sequence $A$ as the number of occurences of the **median** of $A$.\u003cbr\u003e\u003cbr\u003eDefine the **nitness** of a sequence $A$ as the maximum **shikness** over all continuous subsequences of $A$.\u003cbr\u003e\u003cbr\u003eYou want to find a sequence $A$ of length $n$, satisfying $1\\leq A_i\\leq 3$ for every $1\\le i\\leq n$, with the minimum **nitness**.\u003cbr\u003e\u003cbr\u003eCalculate the **nitness** of such sequence.\u003cbr\u003e\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"The input consists of multiple test cases. The first line contains a single integer $T$ ($1 \\le T \\le 2 \\times 10 ^ 5$) - the number of test cases. Description of the test cases follows.\u003cbr\u003e\u003cbr\u003eThe first line of each test case contains one integer $n$ ($1 \\leq n \\leq 10^9$).\u003cbr\u003e"}},{"title":"Output","value":{"format":"HTML","content":"For each test case, print a single integer - the **nitness** of such sequence."}},{"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\u003e6\r\n1\r\n2\r\n3\r\n4\r\n5\r\n6\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e1\r\n1\r\n1\r\n2\r\n2\r\n2\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}