|Author:||М. Спорышев||Time limit:||1 sec|
|Input file:||Standard input||Memory limit:||512 Mb|
|Output file:||Standard output|
The young programmer Vasya lives on the island and has a lunch every day in a cafe near his home. As a regular visitor, Vasya wants to participate in the bonus program of this cafe. Before doing this, he wants to assess the benefits that he could have received if he had been using bonuses for the last N days.
On the i-th day, Vasya spent ai coins for lunch in a cafe. According to the terms of the bonus program, he could either accumulate ⌊ 0.01 ⋅ ai⌋ of the cost of lunch in the form of bonuses, or pay up to ⌊ 0.5 ⋅ ai⌋ with the bonuses that he has.
Help Vasya find out what maximum amount of money he could save, using bonuses during those N days.
The first line contains an integer N — the number of days.
The second line contains N integers ai, separated by a space symbol — the number of coins Vasya spent on lunch on the i-th day.
Output a single integer — the number of coins that Vasya could save using the bonus program.
1 ≤ N ≤ 103
1 ≤ ai ≤ 104
|No.||Standard input||Standard output|