#include <bits/stdc++.h>
using namespace std;
long long isPrime(long long n);
vector<bool> siev();
long long gcd(long long n1, long long n2);
long long lcm(long long n1, long long n2);
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, sum = 0;
  cin >> n;
  vector<long long> o;
  for (int i = 0; i < n; i++) {
    long long in;
    cin >> in;
    if (in % 2 == 0) {
      sum += in;
    } else {
      o.push_back(in);
    }
  }
  sort(o.begin(), o.end(), greater<int>());
  bool all = 0;
  if (o.size() % 2 == 0) {
    all = 1;
  } else {
    all = 0;
  }
  if (all) {
    for (auto i : o) {
      sum += i;
    }
  } else {
    for (int i = 0; i < o.size() - 1; i++) {
      sum += o[i];
    }
  }
  cout << sum;
}
long long gcd(long long n1, long long n2) {
  long long a = max(n1, n2), b = min(n1, n2);
  while (a % b != 0) {
    long long temp = b;
    b = a % b;
    a = temp;
  }
  return b;
}
long long lcm(long long n1, long long n2) { return (n2 * n1) / gcd(n1, n2); }
vector<bool> siev() {
  vector<bool> siv(100005, 1);
  for (long long i = 2; i * i <= 100005; i++) {
    if (siv[i] == 1) {
      for (long long j = i * i; j <= 100005; j += i) {
        siv[j] = 0;
      }
    }
  }
  siv[0] = 0;
  siv[1] = 0;
  return siv;
}
long long isPrime(long long n) {
  if (n == 1) {
    return 1;
  }
  if (n == 2) {
    return 0;
  }
  int divs = 0;
  for (int i = 2; i <= sqrt(n); i++) {
    if (n % i == 0) {
      divs++;
    }
  }
  if (divs > 0) {
    return 1;
  } else {
    return 0;
  }
}
