Super Jumping! Jumping! Jumping!

#include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;


int main()
{
    int n;
    int a[1000] = {0};
    int b[1000] = {0};
    int maxlen[1000] = {0};
    int i = 0;
    int j = 0;
    while (scanf("%d",&n) != EOF)
    {
        if(n == 0)
            return 0;
        else
        {
            for(i =0; i < n; i++)
            {
                scanf("%d",a+i);
                maxlen[i] = a[i];
            }

        }
        maxlen[0] = a[0];
        for(i = 0; i < n; i++)
        {
            for(j = 0; j < i; j++)
            {
                if(a[i] > a[j])
                {

                    maxlen[i] = max(maxlen[j] + a[i],maxlen[i]);
                }

            }
        }
        cout << *max_element(maxlen,maxlen+n) << endl;

    }
    return 0;
}