Sticks

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit     

Description

George took sticks of the same length and cut them randomly until all parts became at most 50 units long. Now he wants to return sticks to the original state, but he forgot how many sticks he had originally and how long they were originally. Please help him and design a program which computes the smallest possible original length of those sticks. All lengths expressed in units are integers greater than zero. 

Input

The input contains blocks of 2 lines. The first line contains the number of sticks parts after cutting, there are at most 64 sticks. The second line contains the lengths of those parts separated by the space. The last line of the file contains zero. 

Output

The output file contains the smallest possible length of original sticks, one per line. 

Sample Input

95 2 1 5 2 1 5 2 141 2 3 40

Sample Output

65

#include
          
           #include
           
            #include
            
             using namespace std;int st[65];bool vis[65];int cnt;int n;int l;bool cmp(int a,int b){    return a>=b;}bool dfs(int num,int len){    if(num==cnt) return true;    for(int i=0;i