#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, p, s = 0;
  cin >> n;
  vector<int> v;
  for (int i = 0; i < n; i++) {
    cin >> p;
    v.push_back(p);
    s += v[i];
  }
  int temp = s;
  sort(v.begin(), v.end());
  for (int i = 0; i < n; i++) {
    if (s % 2 == 0) {
      if (v[i] % 2 != 0) s -= v[i];
    }
    if (s == 0) break;
  }
  if (s != 0 && temp == s && s % 2 == 0)
    cout << '0' << endl;
  else
    cout << s << endl;
  return 0;
}
