hdu1087 dp

#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<cstdio>

using namespace std;

int n;
int a[1010];

int main(){
    
    while(cin >> n){
        if(!n)    break;
        
        for(int i = 1 ; i <= n ; i++){
            cin >> a[i];
        }
        
        int dp[1010];
        int res = 0;
        memset(dp, 0, sizeof(dp));
        dp[1] = a[1];
        
        for(int i = 2 ; i <= n ; i++){            
            for(int j = i - 1 ; j >= 1 ; j--){
                if(a[i] > a[j]){
                    dp[i] = max(dp[i], dp[j] + a[i]);
                }else{
                    dp[i] = max(dp[i], a[i]);
                }            
                res = max(res, dp[i]);
            }
        }
        
        cout << res << endl;        
    }
        
    return 0;
}