package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
)

func out(x ...interface{}) {
	fmt.Println(x...)
}

var sc = bufio.NewScanner(os.Stdin)

func getInt() int {
	sc.Scan()
	i, e := strconv.Atoi(sc.Text())
	if e != nil {
		panic(e)
	}
	return i
}

func getInts(N int) []int {
	ret := make([]int, N)
	for i := 0; i < N; i++ {
		ret[i] = getInt()
	}
	return ret
}

func getString() string {
	sc.Scan()
	return sc.Text()
}

// min, max, asub, absなど基本関数
func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func asub(a, b int) int {
	if a > b {
		return a - b
	}
	return b - a
}

func abs(a int) int {
	if a >= 0 {
		return a
	}
	return -a
}

func lowerBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] >= x
	})
	return idx
}

func upperBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] > x
	})
	return idx
}

//---------------------------------------------
// priority queue
//---------------------------------------------
type pqi struct{ a int }

type priorityQueue []pqi

func (pq priorityQueue) Len() int            { return len(pq) }
func (pq priorityQueue) Swap(i, j int)       { pq[i], pq[j] = pq[j], pq[i] }
func (pq priorityQueue) Less(i, j int) bool  { return pq[i].a < pq[j].a }
func (pq *priorityQueue) Push(x interface{}) { *pq = append(*pq, x.(pqi)) }
func (pq *priorityQueue) Pop() interface{} {
	x := (*pq)[len(*pq)-1]
	*pq = (*pq)[0 : len(*pq)-1]
	return x
}

func main() {
	sc.Split(bufio.ScanWords)
	N := getInt()
	e := make([]int, 0)
	f := make([]int, 0)
	for i := 0; i < N; i++ {
		d := getInt()
		if d >= 0 {
			f = append(f, d)
		} else {
			e = append(e, -d)
		}
	}
	sort.Ints(e)
	sort.Ints(f)
	maxhp := 100
	hp := 100
	// p := 0
	for len(e) != 0 {
		ei := lowerBound(e, hp-1)
		var ehp int
		if ei == 0 {
			ehp = e[0]
			e = e[1:]
		} else {
			ehp = e[ei-1]
			e = append(e[:ei-1], e[ei:]...)
		}
		for ehp >= hp {
			if len(f) == 0 {
				out(0)
				return
			}
			hp = min(maxhp, f[0]+hp)
			f = f[1:]
		}
		hp -= ehp
		maxhp += 100
	}
	for _, v := range f {
		hp = min(maxhp, hp+v)
	}
	out(hp)
}