#include <bits/stdc++.h>
using namespace std;
long double restant(complex<long double> p) { return abs(p); }
const long long N = 1e6 + 9;
const long long mod = 1e6 + 7;
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= mod;
  assert(b >= 0);
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  ;
  long long a[n];
  for (long long i = 0; i < n; i++) cin >> a[i];
  ;
  long long mn = INT_MAX, sm = 0;
  for (long long i = 0; i < n; i++) {
    if (a[i] % 2 == 1) {
      mn = min(mn, a[i]);
    }
    sm += a[i];
  }
  if (sm % 2 == 0) {
    if (mn == INT_MAX)
      cout << 0;
    else {
      sm -= mn;
      cout << sm;
    }
  } else
    cout << sm;
  return 0;
}
