#include <cstdio>

#include <cmath>

#include <cstring>

#include <queue>

#include <vector>

#include <algorithm>

#define INF 0x3f3f3f3f

#define mem(str,x) memset(str,(x),sizeof(str))

#define STOP puts("Pause");

using namespace std;

typedef long long LL;

LL arry[], ans;

int main()

{

    int n;

    scanf("%d", &n);

    ans = ;

    for(int i = ; i <= n; i++){

        scanf("%I64d", &arry[i]);

        ans += arry[i];

    }

    sort(arry + , arry +  + n);

    for(int i = ; (ans & ) && i <= n; i++){

        if(arry[i] & ) ans -= arry[i];

    }

    printf("%I64d\n", ans);

    return ;

}