#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, x;
  cin >> n;
  vector<int> P, I;
  for (int i = 0; i < n; i++) {
    cin >> x;
    ((x % 2) == 0 ? P : I).push_back(x);
  }
  if (I.size() == 0) {
    cout << 0 << endl;
    return 0;
  }
  sort(I.rbegin(), I.rend());
  sort(P.rbegin(), P.rend());
  bool useLast = (I.size() % 2) == 1;
  int sum = 0;
  for (int i = 0; i < P.size(); i++) sum += P[i];
  for (int i = 0; i < I.size(); i++) sum += I[i];
  if (!useLast) sum -= I.back();
  cout << sum << endl;
  return 0;
}
