import java.util.*;
public class HDU1087_dp {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while(sc.hasNext()) {
int n = sc.nextInt();
if(n==0) break;
int[] a = new int[n];
int[] dp = new int[n];
for(int i=0;i<n;i++) {
a[i] = sc.nextInt();
dp[i] = a[i];
}
for(int i=1;i<n;i++) {
for(int j=0;j<i;j++) {
int tmp = 0;
if(a[j]<a[i]) {
tmp = Math.max(tmp, dp[j]);
}
if(tmp!=0)
dp[i] = Math.max(dp[i], tmp+a[i]);
}
}
int res = 0;
for(int i=0;i<n;i++)
res = Math.max(res, dp[i]);
System.out.println(res);
}
}
}