16839번 - Clique Coloring 다국어

There is a complete graph with m vertices. Initially, the edges of the graph are not colored. Snuke performed the following operation for each i(1 ≤ i ≤ n): Choose a_i vertices from the graph and paint all edges that connect two of the chosen points with color i. It turned out that no edges were painted more than once. Compute the minimal possible value of m.

First line of the input contains one integer n (1 ≤ n ≤ 5). Then n lines follow, i-th of these lines contains one integer a_i (2 ≤ a_i ≤ 10⁹).

Print the minimal possible value of m.

Number the vertices of the graph: 1, 2, 3, 4, 5. For example, you can color the graph in the following way:

• Choose three vertices 1, 2, 3 and color edges between them with color 1.
• Choose three vertices 1, 4, 5 and color edges between them with color 2.