Subset Sum

Medium#dynamic-programming· solved by 0 · time limit 2.0 s

Is there a subset of the positive integers whose sum is exactly $t$ ? Print Yes or No.

Input

$n$ , then $n$ positive integers, then $t$ .

Yes or No.

$1 \le n \le 100$ , $1 \le a_i \le 1000$ , $1 \le t \le 10^5$

Input

6
3 34 4 12 5 2
9

Output

Yes

Input

6
3 34 4 12 5 2
30

Output

No