### Super Prime

Time Limit: 5000 ms
Memory Limit: 65536 KiB

#### Problem Description

We all know, prime is a kind of special number which has no other factors except of 1 and itself.

2,3,5,7,11,13,17,19,23,29 are the top 20 primes.

Now there is a new question about prime:

We call a prime as super prime when and only when which can be represented as the sum of multiple continuous primes. For example: 5=2+3, so 5 is a super prime.

Please program to judge whether a number is a super prime or not.

2,3,5,7,11,13,17,19,23,29 are the top 20 primes.

Now there is a new question about prime:

We call a prime as super prime when and only when which can be represented as the sum of multiple continuous primes. For example: 5=2+3, so 5 is a super prime.

Please program to judge whether a number is a super prime or not.

#### Input

The first line is an integer T (T<=1000), and then T lines follow.

There is only one positive integer N(1<N<100000).

There is only one positive integer N(1<N<100000).

#### Output

For each case you should output the case number first, and then the word "yes" if the integer N is a super prime, and you should output "no" otherwise.

#### Sample Input

3 5 7 8

#### Sample Output

Case 1: yes Case 2: no Case 3: no

#### Hint

#### Source

2012年"浪潮杯"山东省第三届ACM大学生程序设计竞赛(热身赛)