#include <bits/stdc++.h>
using namespace std;
const long long MAX = 2500000000;
const int inf = 123456789;
const double EPS = 1e-9;
const double PI = 2 * asin(1.0);
const long long mod = 1e9 + 7;
int double_cmp(double x, double y = 0, double tol = EPS) {
  return (x <= y + tol) ? (x + tol < y) ? -1 : 0 : 1;
}
bool cmp(long long a, long long b) { return a > b; }
int main() {
  int n;
  scanf("%d", &n);
  vector<long long> vetor;
  long long soma = 0LL;
  for (int i = 0; i < n; ++i) {
    int aux;
    scanf("%d", &aux);
    if (aux % 2 == 0)
      soma += aux;
    else
      vetor.push_back(aux);
  }
  sort(vetor.begin(), vetor.end(), cmp);
  for (int i = 0; i < 2 * (((int)vetor.size()) / 2); ++i) soma += vetor[i];
  cout << soma << endl;
}
