#include <bits/stdc++.h>
using namespace std;
vector<int> V;
vector<pair<int, int>> B;
deque<int> D;
map<string, int> mp;
set<int> S;
long long n, m, a, b, c, d, e, f, cnt, ans;
string s;
char q, w, r;
int aru[132];
int arr[124];
char z;
int main() {
  ios_base::sync_with_stdio(0);
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a, cnt += a, V.push_back(a);
  sort(V.begin(), V.end());
  if (cnt % 2 == 1)
    cout << cnt;
  else {
    for (int i = 0; i < V.size(); i++)
      if (V[i] % 2 == 1) {
        c = V[i];
        break;
      }
    if (c == 0)
      cout << 0;
    else
      cout << cnt - c;
  }
}
