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