#include <bits/stdc++.h>
const int N = 100100;
const long long INF = (long long)1e18 + 10;
long long a[N];
int main(void) {
  int n;
  scanf("%d", &n);
  long long answer = 0, minNechet = INF, cntNechet = 0;
  for (int i = 0; i < n; ++i) {
    scanf("%lld", &a[i]);
    answer += a[i];
    if (a[i] % 2 == 1) {
      ++cntNechet;
      minNechet = std::min(minNechet, a[i]);
    }
  }
  if (cntNechet % 2 == 1) {
    answer -= minNechet;
  }
  printf("%lld\n", answer);
  return 0;
}
