Primes Problem

Time Limit: 2000/1000 MS (Java/Others)

Memory Limit: 32768/32768 K (Java/Others)

Description

Given a number n, please count how many tuple(p1, p2, p3) satisfied that p1<=p2<=p3, p1,p2,p3 are primes and p1 + p2 + p3 = n.

Input

Multiple test cases(less than 100), for each test case, the only line indicates the positive integer $n (n \leq 10000)$.

Output

For each test case, print the number of ways.

Sample Input

3 9

Sample Output

0 2

Hint

heyang

Source

BestCoder Round #18

提交代码