#include <bits/stdc++.h>
using namespace std;
long long maxProbeSum(const vector<int>& nums){
    const long long NEG=-4e18;
    int n=nums.size();
    // dp[k][c] = max sum using processed elements, k selected, c >200 count
    vector<vector<long long>> dp(51, vector<long long>(51, NEG)), ndp;
    dp[0][0]=0;
    for(int x:nums){
        ndp=dp; // copy for not taking
        for(int k=0;k<50;++k){
            for(int c=0;c<=50;++c){
                if(dp[k][c]==NEG) continue;
                int nk=k+1, nc=c+(x>200);
                if(nk<=50 && nc<=50){
                    ndp[nk][nc]=max(ndp[nk][nc], dp[k][c]+x);
                }
            }
        }
        dp.swap(ndp);
    }
    long long ans=0; // if impossible keep 0
    for(int k=0;k<=50;++k){
        for(int c=10;c<=50;++c){
            ans=max(ans, dp[k][c]);
        }
    }
    return ans;
}
int main(){ios::sync_with_stdio(false);cin.tie(nullptr);
    int n; if(!(cin>>n)) return 0; vector<int>a(n); for(int i=0;i<n;++i)cin>>a[i];
    cout<<maxProbeSum(a);
    return 0;}

import java.io.*;
import java.util.*;
public class Main {
    static long maxProbeSum(int[] nums){
        final long NEG=-4_000_000_000_000L; // sufficiently small
        long[][] dp=new long[51][51];
        for(int i=0;i<=50;i++) Arrays.fill(dp[i], NEG);
        dp[0][0]=0;
        for(int x:nums){
            long[][] ndp=new long[51][51];
            for(int i=0;i<=50;i++) ndp[i]=dp[i].clone();
            for(int k=0;k<50;k++){
                for(int c=0;c<=50;c++){
                    long cur=dp[k][c];
                    if(cur==NEG) continue;
                    int nk=k+1;
                    int nc=c+(x>200?1:0);
                    if(nk<=50 && nc<=50){
                        ndp[nk][nc]=Math.max(ndp[nk][nc], cur+x);
                    }
                }
            }
            dp=ndp;
        }
        long ans=0;
        for(int k=0;k<=50;k++){
            for(int c=10;c<=50;c++) ans=Math.max(ans, dp[k][c]);
        }
        return ans;
    }
    public static void main(String[] args) throws Exception{
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        String line=br.readLine();
        if(line==null||line.isEmpty()) return;
        int n=Integer.parseInt(line.trim());
        int[] a=new int[n];
        StringTokenizer st=new StringTokenizer(br.readLine());
        for(int i=0;i<n;i++) a[i]=Integer.parseInt(st.nextToken());
        System.out.println(maxProbeSum(a));
    }
}

import sys
def max_probe_sum(nums):
    NEG=-10**18
    dp=[[NEG]*51 for _ in range(51)]
    dp[0][0]=0
    for x in nums:
        ndp=[row[:] for row in dp]
        for k in range(50):
            for c in range(51):
                cur=dp[k][c]
                if cur==NEG: continue
                nk=k+1
                nc=c+(1 if x>200 else 0)
                if nk<=50 and nc<=50:
                    ndp[nk][nc]=max(ndp[nk][nc], cur+x)
        dp=ndp
    ans=0
    for k in range(51):
        for c in range(10,51):
            ans=max(ans, dp[k][c])
    return ans
if __name__=="__main__":
    data=list(map(int,sys.stdin.read().strip().split()))
    if not data:
        sys.exit()
    n=data[0]
    arr=data[1:1+n]
    print(max_probe_sum(arr))

const fs=require('fs');\nconst data=fs.readFileSync(0,'utf8').trim().split(/\\s+/).map(Number);\nif(data.length===0){process.exit(0);} \nlet pos=0; const n=data[pos++]; const nums=data.slice(pos,pos+n);\nfunction maxProbeSum(nums){\n    const NEG=-4e18;\n    const dp=Array.from({length:51},()=>Array(51).fill(NEG));\n    dp[0][0]=0;\n    for(const x of nums){\n        const ndp=dp.map(row=>row.slice());\n        for(let k=0;k<50;k++){\n            for(let c=0;c<=50;c++){\n                const cur=dp[k][c];\n                if(cur===NEG) continue;\n                const nk=k+1, nc=c+(x>200?1:0);\n                if(nk<=50 && nc<=50){\n                    ndp[nk][nc]=Math.max(ndp[nk][nc], cur+x);\n                }\n            }\n        }\n        for(let i=0;i<=50;i++) dp[i]=ndp[i];\n    }\n    let ans=0;\n    for(let k=0;k<=50;k++){\n        for(let c=10;c<=50;c++) ans=Math.max(ans, dp[k][c]);\n    }\n    return ans;\n}\nconsole.log(maxProbeSum(nums).toString());