#include <iomanip>
#include <iostream>
#include <functional>
#include <algorithm>
using namespace std;

//20000000 10000000

long long u[100000];
int main(){
    int n;

    cin >> n;
    long long k = 0;
    for (int i = 0; i < n; i++){
        cin >> u[i];
        k = k + u[i];
    }
    sort(u, u + n);
    long long h = 0;
    if (k % 2 == 1){
        for (int i = 0; i < n; i++){
            if (u[i] % 2 == 1){
                h = u[i];
                break;

            }
        }
    }
    cout << k - h;

}