#include <bits/stdc++.h>
using namespace std;
int v[105], n, dp[105][10005];
int solve(int pos, int sum) {
  if (pos == n) return (sum % 2 == 0 ? -1e9 : sum);
  if (dp[pos][sum] != -1) return dp[pos][sum];
  return dp[pos][sum] = max(solve(pos + 1, sum + v[pos]), solve(pos + 1, sum));
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(nullptr);
  memset(dp, -1, sizeof dp);
  cin >> n;
  for (int i = 0; i < n; i++) cin >> v[i];
  cout << max(solve(0, 0), 0) << endl;
  return 0;
}
