#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10, M = 30005, mod = 1e9 + 7, inf = 0x3f3f3f3f;
int n, x;
long long ans = 0;
int main() {
  scanf("%d", &n);
  int mi = inf, f = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &x);
    if (x & 1) f++, mi = min(mi, x);
    ans += x;
  }
  if (mi == inf || f % 2 == 0)
    cout << ans << endl;
  else
    cout << ans - mi << endl;
}
