#include <bits/stdc++.h>
using namespace std;
int sum1(vector<int> v) {
  int l = v.size();
  int i;
  int val = 0;
  for (i = 0; i < l; i++) {
    val += v[i];
  }
  return val;
}
int main() {
  int n, i, a[1001];
  vector<int> even;
  vector<int> odd;
  int e = 0;
  int o = 0;
  scanf("%d", &n);
  for (i = 0; i < n; i++) {
    scanf("%d", &a[i]);
  }
  sort(a, a + n);
  for (i = n - 1; i >= 0; i--) {
    if (a[i] % 2 == 0) {
      e++;
      even.push_back(a[i]);
    } else {
      o++;
      odd.push_back(a[i]);
    }
  }
  if (o % 2 != 0) {
    cout << sum1(odd) + sum1(even) << endl;
  } else if (odd.size() == 0)
    cout << "0" << endl;
  else {
    cout << sum1(odd) + sum1(even) - odd[odd.size() - 1] << endl;
  }
  return 0;
}
