Category

Similar Problems

0129. Massiv29

Time limit : 1000 ms
Memory limit : 64 mb

Bir o`lchamli sonli massivni $2$ ga, $3$ ga yo`ki $5$ ga bo`linadigan elementlari yig`indisi xisoblansin


Kiruvchi ma’lumotlar: Birinchi satrda $N$ ($1\le N \le 100$). Ikkinchi satrda $N$ ta butun son ($-100\le a[i] \le100$)


Chiquvchi ma’lumotlar: Masala yechimi.

Input
5
97 97 -92 14 22
Output
-56
Input
2
33 98
Output
131