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
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<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int main()
{
int n;
scanf("%d",&n);
int x,x1;
int minn=10000;
int sum=0;
int j=0;
for(int i=1;i<=n;i++)
{
    scanf("%d",&x);
    if(x>0)
    {
        sum+=x;//如果输入的数大于0，相加
        if(x%2&&minn>x)
        minn=x;//如果为奇数并且最小值比x大，更新最小值
        //if(minz>x)
        //minz=x;
    }
    
    if(x<0)//x<0
    {
        if(x%2&&minn>(-x))//如果x为奇数并且最小值大于x的绝对值，更新最小值
        minn=-x;
    }
}
//for(int i=0;i<j;i++)
//printf("%d ",s[i]);
if(sum%2!=0)
printf("%d\n",sum);
else
{
    printf("%d\n",sum-minn);
}
return 0;
}