#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int n, cs = 0, o = 0;
  cin >> n;
  vector<long long> odd;
  for (int i = 0; i < n; i++) {
    int m;
    cin >> m;
    if (m % 2 == 0)
      cs += m;
    else {
      o += m;
      odd.push_back(m);
    }
  }
  sort(odd.begin(), odd.end());
  if (odd.size() % 2 == 0)
    cs += o;
  else
    cs += o - odd[0];
  cout << cs << endl;
  return 0;
}
