#include <bits/stdc++.h>
int n;
long long result = 0;
std::vector<int> nomDivisible;
int main() {
  std::ios::sync_with_stdio(false);
  std::cin >> n;
  int a;
  for (int loop = 0; loop < n; loop++) {
    std::cin >> a;
    if (a % 2 == 0) {
      result += a;
    } else {
      nomDivisible.push_back(a);
    }
  }
  std::sort(nomDivisible.begin(), nomDivisible.end());
  int deb = 0;
  if (nomDivisible.size() % 2 == 1) {
    deb = 1;
  }
  for (int loop = deb; loop < nomDivisible.size(); loop++) {
    result += nomDivisible[loop];
  }
  std::cout << result << std::endl;
}
