Farmer John has a lawnmower, initially turned off. He also has (n) fields, with the (i)-th field having (a_i) dandelions. He will visit all the fields in any order he wants, and each field exactly once . FJ's lawnmower seems to have a mind of its own. Right before visiting a field, it checks if the field has an even or odd number of dandelions. If it has an odd number, then the lawnmower toggles its state (if it is off, it turns on; if it is on, it turns off). Then, if the lawnmower is on, it will cut all dandelions in that field. Otherwise, if the lawnmower is off, then FJ will simply visit the field and cut no dandelions. If FJ visits the (n) fields in optimal order, what is the maximum total number of dandelions he can cut? The first line contains an integer (t) ((1 \leq t \leq 10^4)) — the number of test cases. The first line contains an integer (n) ((1 \leq n \leq 2 \cdot 10^5)) — the number of fields. The following line contains (n) space-separated integers (a_1, a_2, \ldots, a_n) ((1 \leq a_i \leq 10^9)) — the number of dandelions in each field. It is guaranteed that the sum of (n) over all test cases does not exceed (2 \cdot 10^5). For each test case, output an integer on a new line: maximum dandelions FJ can cut if he visits all (n) fields in optimal order. For the first test case, since there is no field with an odd number of dandelions, FJ can never turn his lawnmower on. Since his lawnmower is always off, he can never cut any dandelions, so the answer is (0). For the second test case, FJ can visit the third field first; then his lawnmower will turn on. Then he can visit the other fields in any order. Since his lawnmower is always on, dandelions in every field can be cut. For the third test case, FJ can visit the fields in the following order: field (2), field (1), field (3), then field (4).