#include <bits/stdc++.h>
using namespace std;
long long n, m, x, y, z, k, sol, sum, ans, l, r, c, xx, yy, a[1000000],
    b[1000000];
vector<long long> v;
vector<long long> v1;
vector<long long> v2;
pair<long long, pair<long long, long long> > pp[1000000];
pair<long long, long long> p[1000000];
map<long long, long long> ma;
set<long long> s1, s2, s;
char xc;
bool isPrime(long long x) {
  if (x == 2) return true;
  if (x == 1) return false;
  if (x % 2 == 0) return false;
  for (long long i = 3; i * i <= x; i += 2) {
    if (x % i == 0) return false;
  }
  return true;
}
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> k;
    if (k % 2 == 1)
      x++;
    else
      y++;
    sum += k;
    v.push_back(k);
  }
  sort(v.begin(), v.end());
  if (x == 0)
    cout << x << endl;
  else {
    if (x % 2 == 0) {
      for (int i = 0; i < n; i++) {
        if (v[i] % 2 == 1) {
          sum -= v[i];
          break;
        }
      }
    }
    cout << sum << endl;
  }
  return 0;
}
