{"raw_statement":[{"iden":"problem statement","content":"You are given a sequence $A=(A_1,A_2,\\ldots,A_N)$ of length $N$ consisting of non-negative integers.\nDetermine if there is an even number represented as the sum of two different elements of $A$. If it exists, find the maximum such number."},{"iden":"constraints","content":"*   $2\\leq N \\leq 2\\times 10^5$\n*   $0\\leq A_i\\leq 10^9$\n*   The elements of $A$ are distinct.\n*   All values in the input are integers."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$\n$A_1$ $A_2$ $\\ldots$ $A_N$"},{"iden":"sample input 1","content":"3\n2 3 4"},{"iden":"sample output 1","content":"6\n\nThe values represented as the sum of two distinct elements of $A$ are $5$, $6$, and $7$. We have an even number here, and the maximum is $6$."},{"iden":"sample input 2","content":"2\n1 0"},{"iden":"sample output 2","content":"\\-1\n\nThe value represented as the sum of two distinct elements of $A$ is $1$. We have no even number here, so `-1` should be printed."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}