#include <bits/stdc++.h>
using namespace std;
long long n, a[100001], sum, w;
long long f(long long sum) {
  sort(a + 1, a + n + 1);
  for (int i = 1; i <= n; i++) {
    if (a[i] % 2 == 1) {
      w = 1;
      sum -= a[i];
      break;
    }
  }
  if (w == 1)
    return sum;
  else
    return 0;
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    sum += a[i];
  }
  cout << (sum % 2 == 0 ? sum : f(sum));
}
