#include <bits/stdc++.h>
using namespace std;
vector<int> fard;
int main() {
  int ans = 0;
  int n, minf = 100;
  cin >> n;
  for (int i = 0; i < n; i++) {
    int a;
    cin >> a;
    if (a % 2)
      fard.push_back(a), minf = min(minf, a);
    else
      ans += a;
  }
  if (!fard.size()) {
    cout << 0;
    return 0;
  }
  bool q = 1;
  for (int i = 0; i < fard.size(); i++) {
    if (fard[i] == minf && q)
      q = 0;
    else
      ans += fard[i];
  }
  if (fard.size() % 2)
    cout << ans + minf;
  else
    cout << ans;
  return 0;
}
