{"trustable":false,"sections":[{"title":"","value":{"format":"MD","content":"You see $n$ boxes in circular order. Box $i$ has two adjacents: Box $i+1$ and $i-1$. Box $1$ and $n$ are adjacents.\n\nEach box has some items. If you pick a box, you can\u0027t pick any of its adjacents. Find the maximum sum of items you can get by picking some boxes in this fashion."}},{"title":"Input","value":{"format":"MD","content":"Input starts with an integer $T (\\leq 100)$, denoting the number of test cases.\n\nEach case starts with a line containing an integer $n$ $(2 \\leq n \\leq 1000)$. The next line contains $n$ space separated integers, where the $i_{th}$ integer denotes the number of items in the $i_{th}$ box. All items are in the range $[1, 1000]$."}},{"title":"Output","value":{"format":"MD","content":"For each case, print the case number and the answer."}},{"title":"Sample","value":{"format":"MD","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\u003e3\n2\n10 100\n3\n10 2 11\n4\n8 9 2 8\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eCase 1: 100\nCase 2: 11\nCase 3: 17\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}