#include <iostream>#include <cstdio>#include <cmath>#include <cstring>#include <string>#include <queue>#include <stack>#include <vector>#include <algorithm>using namespace std;int n;int a[100010];int main(){	scanf("%d",&n);	for(int i=1;i<=n;i++) scanf("%d",&a[i]);		sort(a+1,a+1+n);	int sum=0;	for(int i=1;i<=n;i++) 	{		if(a[i]%2==0&&a[i]>0) sum = sum+a[i];	}	int x=0;	int y=-2000000000;	for(int i=n;i>=1;i--)	{		if(a[i]%2==0) continue;		x=x+a[i];		if(x%2==0) continue;		y = max(y,x);	}	printf("%d\n",sum+y);	return 0;}