#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

vector <int> v;

int main() {
    freopen("evensum.in","r",stdin);
    freopen("evensum.out","w",stdout);

    int n;
    cin >> n;
    long long ans = 0;

    for (int i = 0; i < n; i++) {
        int x;
        cin >> x;
        ans += x;
        if (x % 2 == 1) v.push_back(x);
    }

    sort(v.begin(), v.end());

    if (v.size() % 2 == 1) ans -= v[0];

    cout << ans << endl;
    return 0;
}