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