#include <bits/stdc++.h>
using namespace std;
vector<long long int> g[100005];
long long int vis[100005];
vector<long long int> ans;
long long int prime[1000003] = {0};
vector<long long int> divisor(long long int n) {
  vector<long long int> v;
  for (long long int i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      v.push_back(i);
      if (n / i != i) v.push_back(n / i);
    }
  }
  return v;
}
void msieve() {
  prime[0] = 1;
  prime[1] = 1;
  for (long long int i = 2; i <= 1000002; i++) {
    if (prime[i] == 0) {
      prime[i] = i;
      for (long long int j = 2 * i; j <= 1000002; j += i) prime[j] = i;
    }
  }
}
long long int div(long long int n) {
  long long int c = 1, ans = 1;
  while (n > 1) {
    if (prime[n] == prime[n / prime[n]])
      c++;
    else {
      ans *= (c + 1);
      c = 1;
    }
    n = n / prime[n];
  }
  return ans;
}
long long binpow(long long a, long long b, long long m) {
  a %= m;
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = res * a % m;
    a = a * a % m;
    b >>= 1;
  }
  return res;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int t = 1;
  while (t--) {
    long long int n;
    cin >> n;
    long long int a[n];
    long long int s = 0;
    for (long long int i = 0; i < n; i++) {
      cin >> a[i];
      s += a[i];
    }
    if (s % 2 == 1)
      cout << s << endl;
    else {
      sort(a, a + n);
      for (long long int i = 0; i < n; i++) {
        if (a[i] % 2 == 1) {
          s -= a[i];
          break;
        }
      }
      if (s % 2 == 1)
        cout << s << endl;
      else
        cout << 0 << endl;
    }
  }
  return 0;
}
