Vasya and Golden Ticket

ecently 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.

The first line contains one integer n$n$ (2≤n≤100) — the number of digits in the ticket.

The second line contains n$n$ digits a1a2…an (0≤ai≤9) — the golden ticket. Digits are printed without spaces

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

5
73452

YES

4
1248

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.