#include <bits/stdc++.h>
using namespace std;
int n, tmp;
int oddlist[100010], evenlist[100010];
int oddsize, evensize;
long long ans;
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    scanf("%d", &tmp);
    if (tmp % 2)
      oddlist[oddsize++] = tmp;
    else
      evenlist[evensize++] = tmp;
  }
  ans = 0;
  for (int i = 0; i < evensize; ++i) ans += evenlist[i];
  sort(oddlist, oddlist + oddsize);
  if (oddsize % 2) oddlist[0] = 0;
  for (int i = 0; i < oddsize; ++i) ans += oddlist[i];
  cout << ans << endl;
  return 0;
}
