#include <bits/stdc++.h>
using namespace std;
int par[100], impar[100], n;
int main() {
  while (cin >> n) {
    int npar = 0, nimpar = 0;
    for (int i = 0; i < n; ++i) {
      int x;
      cin >> x;
      if (x % 2 == 0) {
        par[npar++] = x;
      } else
        impar[nimpar++] = x;
    }
    if (nimpar == 0) {
      cout << "0\n";
    } else {
      sort(par, par + npar);
      sort(impar, impar + nimpar);
      if (nimpar % 2 == 1)
        cout << (int)accumulate(par, par + npar, 0) +
                    (int)accumulate(impar, impar + nimpar, 0)
             << endl;
      else
        cout << (int)accumulate(par, par + npar, 0) +
                    (int)accumulate(impar + 1, impar + nimpar, 0)
             << endl;
    }
  }
}
