Time Limit: 2000/1000 MS (Java/Others)
Memory Limit: 32768/32768 K (Java/Others)
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.
Multiple test cases(less than 100), for each test case, the only line indicates the positive integer $n (n \leq 10000)$.
For each test case, print the number of ways.
BestCoder Round #18