2866：Special Prime

Give you a prime number p, if you could find some natural number (0 is not inclusive) n and m, satisfy the following expression:
  
We call this p a “Special Prime”.
AekdyCoin want you to tell him the number of the “Special Prime” that no larger than L.
For example:
  If L =20
1^3 + 7*1^2 = 2^3
8^3 + 19*8^2 = 12^3
That is to say the prime number 7, 19 are two “Special Primes”.

The input consists of several test cases.
Every case has only one integer indicating L.(1<=L<=10^6)

For each case, you should output a single line indicate the number of “Special Prime” that no larger than L. If you can’t find such “Special Prime”, just output “No Special Prime!”