#include <bits/stdc++.h>
using namespace std;
inline long long tavan(long long a, long long n, long long mod) {
  long long p = 1;
  while (n > 0) {
    if (n % 2) {
      p = p * a;
      p %= mod;
    }
    n >>= 1;
    a *= a;
    a %= mod;
  }
  return p % mod;
}
long long n, ans;
vector<long long> x;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  while (n--) {
    long long a;
    cin >> a;
    if (a % 2 == 0)
      ans += a;
    else
      x.push_back(a);
  }
  sort(x.begin(), x.end());
  for (int i = (long long)x.size() - 1; i >= (long long)x.size() % 2; i--)
    ans += x[i];
  cout << ans;
  return 0;
}
