#include <bits/stdc++.h>
using namespace std;
const int MAX_NUMBER = 105;
int flower[MAX_NUMBER], odd[MAX_NUMBER], even[MAX_NUMBER];
int number;
int main() {
  scanf("%d", &number);
  int sums = 0;
  int odd_number = 0, even_number = 0;
  for (int i = 1; i <= number; i++) {
    scanf("%d", &flower[i]);
    sums = sums + flower[i];
    if (flower[i] % 2 == 1) {
      odd[odd_number++] = flower[i];
    } else {
      even[even_number++] = flower[i];
    }
  }
  if (odd_number == 0) {
    printf("0\n");
  } else {
    if (odd_number % 2 == 1) {
      printf("%d\n", sums);
    } else {
      sort(odd, odd + odd_number);
      printf("%d\n", sums - odd[0]);
    }
  }
  return 0;
}
