Vasya has an array a consisting of positive integer numbers. Vasya wants to divide this array into two non-empty consecutive parts (the prefix and the suffix) so that the sum of all elements in the first part equals to the sum of elements in the second part. It is not always possible, so Vasya will move some element before dividing the array (Vasya will erase some element and insert it into an arbitrary position).

Inserting an element in the same position he was erased from is also considered moving.

Can Vasya divide the array after choosing the right element to move and its new position?

Input

The first line contains single integer n (1 ≤ n ≤ 100000) — the size of the array.

The second line contains n integers a1, a2... an (1 ≤ ai ≤ 109) — the elements of the array.

Output

Print YES if Vasya can divide the array after moving one element. Otherwise print NO.

Examples

Input

3
1 3 2


Output

YES


Input

5
1 2 3 4 5


Output

NO


Input

5
2 2 3 4 5


Output

YES

Note

In the first example Vasya can move the second element to the end of the array.

In the second example no move can make the division possible.

In the third example Vasya can move the fourth element by one position to the left.
import java.util.*;
import java.math.*;
import java.io.*;
public class Luck{
	public static InputReader sc;
    public static PrintWriter out;
    public static final long MOD = (long) (1e9 + 7);
    public static void main(String[] args){
    	sc=new InputReader(System.in);	
    	out=new PrintWriter(System.out);    	
    	int n=sc.nextInt();
    	long[] A=new long[n+1];
    	long[] pre=new long[n+1];
    	for(int i=1;i<=n;i++){
    		A[i]=sc.nextLong();
    		pre[i]=A[i];
    		if(i>0){
    			pre[i]+=pre[i-1];
    		}
    	}
    	if(pre[n]%2==1 || n==1){
    		out.println("NO");
    	}
    	else{
    		boolean res=false;
    		long sum=pre[n]/2;
        	for(int i=1;i<=n;i++){
        		long val=sum-A[i];
        		int l=0;
        		int r=i-1;
        		while(l<=r){
        			int mid=(l+r)/2;
        			if(pre[mid]==val){
        				res=true;
        				break;
        			}
        			else{
        				if(pre[mid]<val){
        					l=mid+1;
        				}
        				else{
        					r=mid-1;
        				}
        			}
        		}
        		if(res==true){
        			break;
        		}
        		val=sum+A[i];
        		l=i;
        		r=n;
        		while(l<=r){
        			int mid=(l+r)>>1;
        			if(pre[mid]==val){
        				res=true;
        				break;
        			}
        			else{
        				if(pre[mid]>val){
        					r=mid-1;
        				}
        				else{
        					l=mid+1;
        				}
        			}
        		}
        		if(res==true){
        			break;
        		}
        	}
        	if(res){
        		out.println("YES");
        	}
        	else{
        		out.println("NO");
        	}
    	}
    	out.close();
    }
    
    static class Pair{
    	int row;
    	int col;
    	int hour;
    	Pair(){
    		this.row=-1;
    		this.col=-1;
    	}
    	Pair(int s,int e,int h){
    		this.row=s;
    		this.col=e;
    		this.hour=h;
    	}
//    	public static Comparator<Pair> Val=new Comparator<Pair>(){
//    		public int compare(Pair p1,Pair p2){
//    			return (int)p1.cost-(int)p2.cost;
//    		}
//    	};
    }
//    static int val;
//    static class DisjointSet{
//    	int n;
//    	int[] par;
//    	int[] rank;
//    	DisjointSet(int n){
//    		this.n=n;
//    		this.par=new int[n];
//    		this.rank=new int[n];
//    		makeSet();
//    	}
//    	void makeSet(){
//    		for(int i=1;i<n;i++){
//    			par[i]=i;
//    			rank[i]=1;
//    		}
//    	}
//    	void union(int x,int y){
//    		int parX=parent(x);
//    		int parY=parent(y);
//    		if(parX!=parY){
//    			if(rank[parX]>=rank[parY]){
//    				rank[parX]+=rank[parY];
//    				rank[parY]=0;
//    				par[parY]=parX;
//    			}
//    			else{
//    				rank[parY]+=rank[parX];
//    				rank[parX]=0;
//    				par[parX]=parY;
//    			}
//    			val-=1;
//    		}
//    	}
//    	int parent(int c){
//    		int i=c;
//    		while(i!=par[i]){
//    			i=par[i];
//    		}
//    		return i;
//    	}
//    }
    static int gcd(int a,int b){
    	if(b==0){
    		return a;
    	}
    	return gcd(b,a%b);
    	
    }
    static int lcm(int a,int b){
    	int g;
    	if(a<b){
    		g=gcd(b,a);
    	}
    	else{
    		g=gcd(a,b);
    	}
    	return (a*b)/g;
    }
    static long bigmod ( long a, long p, long m ) {
        long res = 1 % m, x = a % m;
        while ( p>0 ) {
            if ( (p & 1)==1 ) res = ( res * x ) % m;
            x = ( x * x ) % m; p >>= 1;
        }
        return res;
    }
    static boolean isPrime(int n){
    	 if (n == 2)
    	        return true;
    	    for (long i = 2; i * i <= n; i++) {
    	        if (n % i == 0)
    	            return false;
    	    }
    	    return true;
    }
    
    static void shuffle(int[] A){
    	for(int i=A.length-1;i>0;i--){
    		int j=(int)(Math.random()*(i+1));
    		int temp=A[j];
    		A[j]=A[i];
    		A[i]=temp;
    	}
    }
    
	public static class Node implements Comparable<Node>{
	    int u;
	    int v;
	    public Node(){
	    	;
	    }
	    public Node (int u, int v) {
	    	this.u = u;
	        this.v = v;
	    }
	    
	    public void print() {
	        out.println(v + " " + u + " ");
	    }
	   
	    public int compareTo(Node n1){
	    	return this.u-n1.u;
	    }
	}
	public static long pow(long base,long exp,long mod){
		if(exp==0){
			return 1;
		}
		if(exp==1){
			return base;
		}
		long temp=exp/2;
		long val=pow(base,temp,mod);
		long result=val*val;
		result=(result%mod);
		long AND=exp&1;
		if(AND==1){
			result*=base;
			result=(result%mod);
		}
		return result;
	}
	public static BigInteger pow(BigInteger base, BigInteger exp) {
	    if(exp.equals(new BigInteger(String.valueOf(0)))){
	        return new BigInteger(String.valueOf(1));
	    }    
	    if(exp.equals(new BigInteger(String.valueOf(1))))
	        return base;
	    BigInteger temp=exp.divide(new BigInteger(String.valueOf(2)));
	    BigInteger val = pow(base, temp);
	    BigInteger result = val.multiply(val);
	    result=result.remainder(new BigInteger(String.valueOf(MOD)));
	    BigInteger AND=exp.and(new BigInteger(String.valueOf(1)));
	    if(AND.equals(new BigInteger(String.valueOf(1)))){
	        result = result.multiply(base);
	        result=result.remainder(new BigInteger(String.valueOf(MOD)));
	    }    
	    return result;
	}
	    
	static class InputReader {

	    private InputStream stream;
	    private byte[] buf = new byte[8192];
	    private int curChar, snumChars;
	    private SpaceCharFilter filter;

	    public InputReader(InputStream stream) {
	        this.stream = stream;
	    }

	    public int snext() {
	        if (snumChars == -1)
	            throw new InputMismatchException();
	        if (curChar >= snumChars) {
	            curChar = 0;
	            try {
	                snumChars = stream.read(buf);
	            } catch (IOException e) {
	                throw new InputMismatchException();
	            }
	            if (snumChars <= 0)
	                return -1;
	        }
	        return buf[curChar++];
	    }

	    public int nextInt() {
	        int c = snext();
	        while (isSpaceChar(c))
	            c = snext();
	        int sgn = 1;
	        if (c == '-') {
	            sgn = -1;
	            c = snext();
	        }
	        int res = 0;
	        do {
	            if (c < '0' || c > '9')
	                throw new InputMismatchException();
	            res *= 10;
	            res += c - '0';
	            c = snext();
	        } while (!isSpaceChar(c));
	        return res * sgn;
	    }

	    public long nextLong() {
	        int c = snext();
	        while (isSpaceChar(c))
	            c = snext();
	        int sgn = 1;
	        if (c == '-') {
	            sgn = -1;
	            c = snext();
	        }
	        long res = 0;
	        do {
	            if (c < '0' || c > '9')
	                throw new InputMismatchException();
	            res *= 10;
	            res += c - '0';
	            c = snext();
	        } while (!isSpaceChar(c));
	        return res * sgn;
	    }

	    public int[] nextIntArray(int n) {
	        int a[] = new int[n];
	        for (int i = 0; i < n; i++)
	            a[i] = nextInt();
	        return a;
	    }

	    public String readString() {
	        int c = snext();
	        while (isSpaceChar(c))
	            c = snext();
	        StringBuilder res = new StringBuilder();
	        do {
	            res.appendCodePoint(c);
	            c = snext();
	        } while (!isSpaceChar(c));
	        return res.toString();
	    }

	    public boolean isSpaceChar(int c) {
	        if (filter != null)
	            return filter.isSpaceChar(c);
	        return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
	    }

	    public interface SpaceCharFilter {
	        public boolean isSpaceChar(int ch);
	    }
	}

}

