#include <bits/stdc++.h>
int cmpfunc(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main(void) {
  long n;
  scanf("%ld", &n);
  long arr[n];
  if (n <= 0)
    printf("0");
  else {
    long count;
    for (count = 0; count < n; count++) {
      scanf("%ld", &arr[count]);
    }
    qsort(arr, n, sizeof(long), cmpfunc);
    long long tong = 0;
    for (count = 0; count < n; count++) {
      tong += arr[count];
    }
    if (tong % 2 == 0)
      printf("%lld", tong);
    else {
      for (count = 0; count < n; count++)
        if (arr[count] % 2 == 1) {
          tong -= arr[count];
          break;
        }
      printf("%lld", tong);
    }
  }
}
