#include <bits/stdc++.h>
using namespace std;
int cmp(const void* a, const void* b) {
  return *(long long int*)a - *(long long int*)b;
}
int a[100005] = {0};
int b[100005] = {0};
int main() {
  int countodd = 0;
  int n;
  long long int sum = 0;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    if (a[i] % 2)
      b[countodd++] = a[i];
    else
      sum += a[i];
  }
  qsort(b, countodd, sizeof(b[0]), cmp);
  int i;
  if (countodd % 2) {
    for (int i = 1; i < countodd; i++) {
      sum += b[i];
    }
  } else {
    for (int i = 0; i < countodd; i++) {
      sum += b[i];
    }
  }
  cout << sum << endl;
  return 0;
}
