Composite Sequence

아직 제출이 없습니다시간 제한1초메모리 제한256 MB

문제 설명

예제2

문제

A sequence $S$ of positive integers is a composite sequence if and only if there is a non-empty subsequence $T$ of $S$ such that the sum of all integers in $T$ is a composite number.

Given $S$ , your task is to check whether $S$ is a composite sequence.

Note that $1$ is not a composite number.

Recall that $T$ is a subsequence of $S$ if and only if we can obtain $T$ by removing some elements of $S$ (possibly none or all).

입력

The first line contains a single integer $n$ ( $1 \le n \le 10^5$ ), the size of $S$ .

The second line contains $n$ integers $S\_1, S\_2, \ldots, S\_n$ : the elements of $S$ ( $1 \le S\_i \le 10^9$ ).

출력

If $S$ is a composite sequence, output "Yes". Otherwise, output "No".