#include <bits/stdc++.h>
using namespace std;
int c[101], nc[101];
bool f(int x, int y) { return x > y; }
int main() {
  int n, t, ans = 0, l = 0, r = 0;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> t;
    if (t % 2 == 0) {
      c[l] = t;
      l++;
    } else {
      nc[r] = t;
      r++;
    }
  }
  sort(c, c + l, f);
  sort(nc, nc + r, f);
  if (r % 2 != 0) {
    for (int i = 0; i < l; i++) {
      ans += c[i];
    }
    for (int i = 0; i < r; i++) {
      ans += nc[i];
    }
  } else {
    for (int i = 0; i < l; i++) {
      ans += c[i];
    }
    for (int i = 0; i < r - 1; i++) {
      ans += nc[i];
    }
  }
  if (r == 0) {
    ans = 0;
  }
  cout << ans;
  return 0;
}
