CodeForces - 1030C（思维题）

Recently Vasya found a golden ticket — a sequence which consists of n digits a1a2…an. Vasya considers a ticket to be lucky if it can be divided into two or more non-intersecting segments with equal sums. For example, ticket 350178 is lucky since it can be divided into three segments 350, 17 and 8: 3+5+0=1+7=8

. Note that each digit of sequence should belong to exactly one segment.

Help Vasya! Tell him if the golden ticket he found is lucky or not.

Input

The first line contains one integer n

(2≤n≤100

) — the number of digits in the ticket.

The second line contains n

digits a1a2…an (0≤ai≤9

) — the golden ticket. Digits are printed without spaces.

Output

If the golden ticket is lucky then print "YES", otherwise print "NO" (both case insensitive).

Examples

Input

5
73452

Output

YES

Input

4
1248

Output

NO

Note

In the first example the ticket can be divided into 7

, 34 and 52: 7=3+4=5+2

.

In the second example it is impossible to divide ticket into segments with equal sum.

分析：判断一个数的各个位数是否能分成两个及两个以上的式子的和。

#include<iostream>
#include<cstring>
#include<string.h>
using namespace std;
int n;
char s[200];
int main()
{
	int sum = 0;
	scanf("%d",&n);
	getchar();
	cin.getline(s,200);
	int num = 0;
	for(int i = 0; i < n; i ++)
		sum = sum + s[i] - '0';
	if(!sum)
	{
		printf("yes\n");
		return 0;
	} 
	int flag = 0;
	for(int i = 1; i < sum ; i ++)
	{
		if(sum%i)
			continue;
		int t = 0;
		for(int j = 0; j < n; j ++)
		{
			t = t + s[j] - '0';
			if((t==i||t==0)&&j==n-1)
			{
				if(flag)
					printf("yes\n");
				else
					printf("no\n");
				return 0;
			}
			if(t==i)
			{
				t = 0;
				flag++;
			}
			if(t>i)
				break;
		}
	} 
	printf("no\n");
}