package main

import . "fmt"
import . "os"
import bf "bufio"
import . "sort"

func main() {
	rd:=bf.NewReader(Stdin)
	var n int
	Fscan(rd,&n)
	ms:=make([]int,0,n)
	ps:=make([]int,0,n)
	for i:=0;i<n;i++ {
		var a int
		Fscan(rd,&a)
		if a==0 {
			continue
		} else if a< 0 {
			ms=append(ms,a)
		} else {
			ps=append(ps,a)
		}
	}
	Ints(ms)
	Sort(Reverse(IntSlice(ps)))
	for len(ms)>0&&len(ps)>0&&len(ms)+len(ps)>1 {
		ml:=len(ms)-1
		pl:=len(ps)-1
		me:=ms[ml]
		pe:=ps[pl]
		ms=ms[:ml]
		ps=ps[:pl]
		e:=pe+me
		if e<0 {
			ms=append(ms,e)
		} else if e>0 {
			ps=append(ps,e)
		}
	}
	if len(ms)+len(ps)<=1 {
		Println("Yes")
	} else {
		Println("No")
	}
}