Problem A
Opening Ceremony

For the grand opening of the algorithmic games in NlogNsglow, a row of tower blocks is set to be demolished in a grand demonstration of renewal. Originally the plan was to accomplish this with controlled explosions, one for each tower block, but time constraints now require a hastier solution.
To help you remove the blocks more rapidly you have been
given the use of a Universal Kinetic / Incandescent Energy
Particle Cannon (UKIEPC). On a single charge, this cutting-edge
contraption can remove either all of the floors in a single
tower block, or all the
Task
Given the number of floors of all towers, output the minimum number of charges needed to eliminate all floors of all blocks.
Input
The first line of input contains the number of blocks
Output
Output one line containing one integer: the minimum number of charges needed to tear down all the blocks.
Sample Input 1 | Sample Output 1 |
---|---|
6 2 1 8 8 2 3 |
5 |
Sample Input 2 | Sample Output 2 |
---|---|
5 1 1 1 1 10 |
2 |