#include <bits/stdc++.h>
using namespace std;
int main() {
  unsigned long long n, a, sum = 0, o = 0;
  cin >> n;
  vector<unsigned long long> odd;
  while (n--) {
    cin >> a;
    if (a % 2)
      odd.push_back(a), o = 1;
    else
      sum += a;
  }
  if (o) {
    sort(odd.rbegin(), odd.rend());
    for (int i = 0; i < odd.size() - 1; i++) {
      sum += odd[i];
    }
    if (odd.size() % 2 == 0) {
      sum += odd[odd.size() - 1];
    }
  }
  cout << sum << endl;
}
