#include <bits/stdc++.h>
using namespace std;
int n, k, a[101], m, ans;
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> k;
    if (k % 2) a[++m] = k;
    ans += k;
  }
  if (m == 0) {
    cout << 0 << endl;
    return 0;
  }
  if (m % 2 == 0) {
    sort(a + 1, a + m + 1);
    ans -= a[1];
  }
  cout << ans << endl;
  return 0;
}
