Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
B. Odd sum

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou are given sequence *a*_{1}, *a*_{2}, ..., *a*_{n} of integer numbers of length *n*. Your task is to find such subsequence that its sum is odd and maximum among all such subsequences. It's guaranteed that given sequence contains subsequence with odd sum.

Subsequence is a sequence that can be derived from another sequence by deleting some elements without changing the order of the remaining elements.

You should write a program which finds sum of the best subsequence.

Input

The first line contains integer number *n* (1 ≤ *n* ≤ 10^{5}).

The second line contains *n* integer numbers *a*_{1}, *a*_{2}, ..., *a*_{n} ( - 10^{4} ≤ *a*_{i} ≤ 10^{4}). The sequence contains at least one subsequence with odd sum.

Output

Print sum of resulting subseqeuence.

Examples

Input

4

-2 2 -3 1

Output

3

Input

3

2 -5 -3

Output

-1

Note

In the first example sum of the second and the fourth elements is 3.

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jan/28/2021 01:17:51 (f1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|