#include <bits/stdc++.h>
const int EPS = 1e-8;
using namespace std;
const int maxn = 1e6 + 10;
long long even[maxn];
long long odd[maxn];
int main() {
  int n, cntEven = 0, cntOdd = 0;
  cin >> n;
  getchar();
  while (n--) {
    long long temp = 0;
    scanf("%I64d", &temp);
    temp % 2 == 0 ? even[cntEven++] = temp : odd[cntOdd++] = temp;
  }
  long long ans = 0;
  for (int i = 0; i < cntEven; i++) {
    ans += even[i];
  }
  if (cntOdd % 2 == 0) {
    for (int i = 0; i < cntOdd; i++) {
      ans += odd[i];
    }
  } else {
    sort(odd, odd + cntOdd);
    for (int i = cntOdd - 1; i > 0; i--) {
      ans += odd[i];
    }
  }
  cout << ans << endl;
  return 0;
}
