#include <bits/stdc++.h>
using namespace std;
int memo[101][10005];
int a[101];
int solve(int i, int sum, int n) {
  if (i > n) return sum % 2 ? sum : 0;
  if (memo[i][sum] != -1) return memo[i][sum];
  return memo[i][sum] = max(solve(i + 1, sum + a[i], n), solve(i + 1, sum, n));
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", a + i);
  memset(memo, -1, sizeof memo);
  return !printf("%d\n", solve(1, 0, n));
}
