#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int n;
unsigned long long x;
unsigned long long a[100005];
int main() {
  cin >> n;
  unsigned long long sum = 0ll;
  int tot = 0;
  while (n--) {
    cin >> x;
    if (x % 2 == 0)
      sum += 1ll * x;
    else
      a[tot++] = x;
  }
  sort(a, a + tot);
  int f1 = 1;
  if (tot % 2 == 0) f1 = 0;
  for (int i = tot - 1; i >= f1; i--) {
    sum += 1ll * a[i];
  }
  cout << sum;
  return 0;
}
