Educational Codeforces Round 19 B

Description

You are given sequence a₁, a₂, ..., 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⁵).

The second line contains n integer numbers a1, a2, ..., an ( - 10⁴ ≤ a_i≤ 10⁴). 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.

题意：求子序列和最大为奇数是多少

解法：奇数和偶数相加减的关系

 #include <iostream>
 #include <cstdio>
 #include <cstdlib>
 #include <algorithm>
 #include <queue>
 #include <stack>
 #include <map>
 #include <cstring>
 #include <climits>
 #include <cmath>

 using namespace std;

 const int maxn = ;
 long long a[maxn],b[maxn],c[maxn],dp[maxn];
 long long m,n;
 long long sum;
 long long Min=(1e6);
 long long Minn=(1e6);
 int main()
 {
     cin>>n;
     for(int i=;i<=n;i++)
     {
         cin>>a[i];
         if(a[i]>=)
         {
             sum+=a[i];
             if(a[i]%)
             {
                 Minn=min(Minn,a[i]);
             }
         }
         else
         {
             long long ans=abs(a[i]);
             if(ans%)
             {
                 Min=min(ans,Min);
              //   cout<<Min<<endl;
             }
         }
     }
     if(sum%)
     {
         cout<<sum<<endl;
     }
     else
     {
         cout<<max(sum-Min,sum-Minn)<<endl;
     }
     return ;
 }