#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
const int N = int(1e5) + 10;
const int MOD = 1000000000 + 7;
int n, a[N];
long long Ans;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  sort(a + 1, a + n + 1);
  int Flag = 0;
  Ans = 0;
  for (int i = n; i >= 1; i--) {
    if (a[i] % 2 == 0)
      Ans += a[i];
    else {
      if (!Flag)
        Flag = a[i];
      else {
        Ans += (long long)Flag + a[i];
        Flag = 0;
      }
    }
  }
  cout << Ans << endl;
  return 0;
}
