#include <bits/stdc++.h>
using namespace std;
const int N = 1e2 + 1, M = 1e3 + 9, OO = 10000007;
const double EPS = 0.0000001;
int n, x, last;
long long sum;
vector<int> v;
int main() {
  scanf("%d", &n);
  v.reserve(1000001);
  for (int i = 0; i < n; ++i) {
    scanf("%d", &x);
    if (x & 1)
      v.push_back(x);
    else
      sum += x;
  }
  sort(v.rbegin(), v.rend());
  for (int i = 0; i + 1 < v.size(); i += 2) {
    sum += v[i] + v[i + 1];
  }
  printf("%lld\n", sum);
  return 0;
}
