#include <bits/stdc++.h>
using namespace std;
unsigned power(unsigned val, unsigned _pow = 0) {
  if (_pow <= 0) return 1;
  return val * power(val, _pow - 1);
}
int str2int(const string &str) {
  stringstream ss(str);
  int num;
  if ((ss >> num).fail()) {
  }
  return num;
}
bool comp(long long x, long long y) { return x > y; }
vector<vector<int> > adjList;
vector<int> dfs_num;
vector<int> dfs_low;
vector<int> dfs_parent;
vector<int> visited;
vector<bool> articulation_vertex;
vector<int> ts;
int dfsRoot, rootChildren, dfsNumberCounter;
int V, E;
map<string, int> mp;
int numSCC;
vector<int> S;
int main() {
  int n;
  cin >> n;
  long long arr[n];
  for (int i = 0; i < n; i += 1) cin >> arr[i];
  sort(arr, arr + n, comp);
  long long sum = 0;
  for (int i = 0; i < n; i += 1) sum += arr[i];
  for (int i = n - 1; i >= 0; i--) {
    if (sum == 0) break;
    if (sum % 2 == 0) break;
    if (arr[i] % 2 != 0) sum -= arr[i];
  }
  cout << sum;
  return 0;
}
