#include <bits/stdc++.h>
using namespace std;
void bubbleSort(int b[], int n);
int main() {
  int a[100001], i, n, b[100001], j = 1, k, temp;
  long long sum = 0;
  cin >> n;
  for (i = 1; i <= n; i++) {
    cin >> a[i];
    if (a[i] % 2 == 0)
      sum += a[i];
    else
      b[j++] = a[i];
  }
  k = j - 1;
  if (k % 2 == 0) {
    for (j = 1; j <= k; j++) sum += b[j];
  } else {
    temp = b[1];
    for (j = 1; j <= k; j++) {
      if (temp > b[j]) temp = b[j];
      sum += b[j];
    }
  }
  sum -= temp;
  cout << sum;
  return 0;
}
