Logo
(追記) (追記ここまで)

19805번 - Attractive Flowers 다국어

시간 제한메모리 제한제출정답맞힌 사람정답 비율
1 초 512 MB1931068655.128%

문제

Maxim wants to give a bouquet of flowers to his girlfriend Ira for her birthday.

The flower shop near his house sells flowers of $n$ types. Maxim has found out that the store has $a_i$ flowers of the $i$-th type. He knows that Ira likes odd numbers. Therefore, Maxim has decided that there should be an odd number of flowers of each type in the bouquet, and the total number of flowers in the bouquet should also be odd.

Help Maxim determine the maximum number of flowers the bouquet can consist of.

입력

The first line contains an integer $n$ --- the number of types of flowers that are sold in the store (1ドル \le n \le 100,000円$).

The second line contains $n$ integers $a_1, a_2, \ldots, a_n$ --- the number of flowers of each type (1ドル \le a_i \le 1000$).

출력

Print one number --- the maximum number of flowers the bouquet can consist of.

제한

예제 입력 1

3
3 5 8

예제 출력 1

15

예제 입력 2

3
1 1 1

예제 출력 2

3

힌트

출처

Olympiad > Russian Olympiad in Informatics > Russia Team High School Programming Contest > Russia Team High School Programming Contest 2019 A번

(追記) (追記ここまで)

출처

대학교 대회

  • 사업자 등록 번호: 541-88-00682
  • 대표자명: 최백준
  • 주소: 서울시 서초구 서초대로74길 29 서초파라곤 412호
  • 전화번호: 02-521-0487 (이메일로 연락 주세요)
  • 이메일: contacts@startlink.io
  • 통신판매신고번호: 제 2017-서울서초-2193 호

AltStyle によって変換されたページ (->オリジナル) /