#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 9;
vector<int> odd;
long long n, a, sum, ans;
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a;
    if (!(a % 2))
      ans += a;
    else {
      odd.push_back(a);
      sum += a;
    }
  }
  sort(odd.begin(), odd.end());
  if (!(odd.size() % 2))
    cout << ans + sum;
  else
    cout << ans - odd[0] + sum;
}
