CCCGuide

Problem S4: Combining Riceballs

2016 · S4 · Original problem · DMOJ

Problem Description

Alphonse has NN rice balls of various sizes in a row. He wants to form the largest rice ball possible for his friend to eat. Alphonse can perform the following operations:

Alphonse can perform each operation as many times as he wants.

Determine the size of the largest rice ball in the row after performing 0 or more operations.

Input Specification

The first line will contain the integer, NN (1≤N≤400)(1 \leq N \leq 400).

The next line will contain NN space separated integers representing the sizes of the riceballs, in order from left to right. Each integer is at least 11 and at most 1 000 0001\ 000\ 000.

Output Specification

Output the size of the largest riceball Alphonse can form.

Sample Input 1

7
47 12 12 3 9 9 3

Output for Sample Input

48

Explanation for Output for Sample Input 1

One possible set of moves to create a riceball of size 48 is to combine 12 and 12, forming a riceball of size 24. Then, combine 9 and 9 to form a riceball of size 18. Then, combine 3, 18 and 3 to form a riceball of size 24. Finally, combine the two riceballs of size 24 to form a riceball of size 48.

Sample Input 2

4
1 2 3 1

Output for Sample Input 2

3

Explanation for Output for Sample Input 2

There are no moves to make, thus the largest riceball in the row is size 3.