Educational Codeforces Round 19 B. Odd sum

You are given sequence a1, a2, ..., an 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 ≤ 105).

The second line contains n integer numbers a1, a2, ..., an ( - 104 ≤ ai ≤ 104). The sequence contains at least one subsequence with odd sum.

Output

Print sum of resulting subseqeuence.

Examples

input

Copy

4
-2 2 -3 1

output

Copy

3

input

Copy

3
2 -5 -3

output

Copy

-1

Note

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

题意：

求子序列的最大奇数。

思路:这道题我刚开始第一想法是最大字段和加限制条件看能不能解决出来，但想了想dp我推不出来，只能从奇偶出发，偶数加奇数一定是偶数，又因为题目保证一定有解这意味着一定有奇数所以我们可以贪首先先将所有的大于0的偶数加起来然后加一个最大的奇数构成一个最大的奇数，再从剩余的所有奇数从大到小两个相加组成偶数贡献给答案。得出的就是最大的奇数。（证名的话自己想想应该就知道）

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#define LL long long

using namespace std;
const int maxn=1e5+100;
int a[maxn];
int main()
{
    int n;
    scanf("%d",&n);
    int sum=0,j=0;
    for(int i=1;i<=n;i++)
    {
        int x;
        scanf("%d",&x);
        if(x%2)
        {
            a[j++]=x;
            continue;
        }
        if(x>0)
        {
            sum+=x;
        }
    }
    sort(a,a+j);
    sum+=a[j-1];
    for(int l=j-2;l>0;l-=2)
    {
          int cnt=a[l]+a[l-1];
          if(cnt>0)
            sum+=cnt;
    }
    printf("%d\n",sum);
    return 0;
}