#include <bits/stdc++.h>
using std::cin;
using std::cout;
using std::deque;
using std::endl;
using std::map;
using std::max;
using std::min;
using std::pair;
using std::queue;
using std::sort;
using std::string;
using std::vector;
int main() {
  int n;
  cin >> n;
  int data[100000] = {
      0,
  };
  int i;
  for (i = 0; i < n; i++) cin >> data[i];
  sort(data, data + n);
  long long sum = 0;
  int cur = -1;
  for (i = n - 1; i >= 0; i--) {
    if (data[i] % 2 == 0) {
      sum = sum + data[i];
    } else if (cur == -1) {
      cur = data[i];
    } else {
      sum = sum + cur + data[i];
      cur = -1;
    }
  }
  cout << sum;
  return 0;
}
