2013=8=3

//最长递增子序列求和
#include<iostream>
using namespace std;
int main()
{
    int max;
    int m;
    int a[1010],s[1010];
    int t;
    int n;
    while(cin>>n&&n)
    {
        int i,j;
        m=0;
        for(i=0;i<n;i++)
        {
            scanf("%d",&a[i]);
            s[i]=a[i];
            max=0;
            for(j=i-1;j>=0;j--)
            {
                if(a[j]<a[i]&&s[j]>max)
                    max=s[j];
            }
            s[i]+=max;
            if(s[i]>m)
                m=s[i];
        }
        cout<<m<<endl;
    }
    return 0;
}