#include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000000 + 7;
const double esp = 1e-13;
const double pi = 3.141592653589;
int n, a[100 + 10];
bool f[10000 + 10];
int main() {
  cin >> n;
  for (int i = (1), _b = (n); i <= _b; i++) cin >> a[i];
  memset(f, false, sizeof(f));
  f[0] = true;
  for (int i = (1), _b = (n); i <= _b; i++)
    for (int j = (10000), _b = (0); j >= _b; j--)
      if (j - a[i] >= 0) f[j] |= f[j - a[i]];
  for (int i = (10000), _b = (0); i >= _b; i--)
    if (f[i] && i % 2) {
      cout << i;
      return 0;
    }
  cout << 0;
}
