#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int dp[1001],a[1001];
int main(){
int n;
while(cin>>n&&n){
for(int i = 0;i<n;++i){
cin>>a[i];
}
int res = 0;
memset(dp,0,sizeof(dp));
for(int i = 0;i<n;++i){
for(int j = 0;j<i;++j){
if(a[i] > a[j])
dp[i] = max(dp[i],dp[j]);
}
dp[i] += a[i];
res = max(res,dp[i]);
}
cout<<res<<endl;
}
return 0;
}
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int dp[1001],a[1001];
int main(){
int n;
while(cin>>n&&n){
for(int i = 0;i<n;++i){
cin>>a[i];
}
int res = 0;
memset(dp,0,sizeof(dp));
for(int i = 0;i<n;++i){
for(int j = 0;j<i;++j){
if(a[i] > a[j])
dp[i] = max(dp[i],dp[j]);
}
dp[i] += a[i];
res = max(res,dp[i]);
}
cout<<res<<endl;
}
return 0;
}