#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll md = 1000000007;
ll exp(ll a, ll b) {
  ll r = 1ll;
  while (b > 0) {
    if (b & 1) {
      r = r * (a % md);
      r = (r + md) % md;
    }
    b >>= 1;
    a = (a % md) * (a % md);
    a = (a + md) % md;
  }
  return (r + md) % md;
}
ll gcd(ll a, ll b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
ll Min(ll a, ll b) {
  if (a < b) return a;
  return b;
}
ll Max(ll a, ll b) {
  if (a > b) return a;
  return b;
}
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ll n, a;
  cin >> n;
  vector<ll> v1, v2;
  for (ll i = 0; i <= n - 1; ++i) {
    cin >> a;
    if (a & 1)
      v1.push_back(a);
    else
      v2.push_back(a);
  }
  sort(v1.begin(), v1.end());
  reverse(v1.begin(), v1.end());
  long long sum = 0;
  if (!v2.empty())
    for (ll i = 0; i <= v2.size() - 1; ++i) sum += v2[i];
  if (!v1.empty())
    for (ll i = 0; i <= v1.size() - 1; ++i) sum += v1[i];
  if (!v1.empty() && v1.size() & 1) sum -= v1.back();
  cout << sum;
  cout << '\n';
  return 0;
}
