{"raw_statement":[{"iden":"problem statement","content":"We have $2N$ cards, with ID numbers from $1$ through $2N$. Card $i$ has a value of $V_i$. Takahashi and Aoki will do the following procedure $N$ times so that each of them gets $N$ cards.\n\n*   First, Takahashi chooses one card that is not yet chosen and gets it. Then, Aoki chooses the card whose **ID number** is the median of those of the cards not yet chosen and gets it.\n\nFind the maximum possible sum of the values of cards Takahashi has in the end."},{"iden":"constraints","content":"*   $1\\leq N\\leq 2\\times 10^5$\n*   $0\\leq V_i\\leq 10^9$\n*   $V_i$ is an integer."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$V_1$ $V_2$ $\\cdots$ $V_{2N}$"},{"iden":"sample input 1","content":"3\n1 2 3 4 5 6"},{"iden":"sample output 1","content":"15\n\nTakahashi can get Cards $4$, $5$, and $6$ as follows:\n\n*   First, Takahashi chooses Card $6$, which makes Aoki choose Card $3$.\n*   Next, Takahashi chooses Card $5$, which makes Aoki choose Card $2$.\n*   Lastly, Takahashi chooses Card $4$, which makes Aoki choose Card $1$."},{"iden":"sample input 2","content":"4\n1 4 5 8 7 6 3 2"},{"iden":"sample output 2","content":"20"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}