package hduoj;

import java.util.Scanner;

public class hdoj_1087 {

    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);

        while(true){

            int count = sc.nextInt();

            if(count==0) break;

            int[] path = new int[count];

            for(int i = 0;i<count;++i){

                path[i] = sc.nextInt();

            }

            int[] each_maxmium = new int[count];

            each_maxmium[0] = path[0];

            for(int i = 1;i<count;++i){

                each_maxmium[i] = path[i];

                for(int j = 0;j<i;++j){

                    if(path[j]<path[i]&&each_maxmium[i]<path[i] + each_maxmium[j]){//两个条件保证递增以及each_maxmium数组每一项是最大

                        each_maxmium[i] = path[i] + each_maxmium[j];

                    }

                }

            }

            int max = -1;

            for(int i = 0;i<each_maxmium.length;++i){

                if(each_maxmium[i]>max){

                    max = each_maxmium[i];

                }

            }

            System.out.println(max);

        }

    }

}