DIV - Divisors

Let N be a positive integer. In theory it is easy to decide if d(N) (the number of positive divisors of N including 1 and N) is prime or not. Your task is just a little bit harder: compute all N in [1,10^6] for which d(N)=p*q where p and q distinct primes.

Input

There is no input for this problem.

Output

To make the problem less io related write out only every 9-th of them, one per line.

Output:
50
99
162
...
999524
999728
999927

Added by:czylabsonasa
Date:2005-05-16
Time limit:0.705s
Source limit:3333B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All
Resource:Folklore.

hide comments
2013-01-08 14:08:12 Naman_Amit_Prashant
@Govardhan Reddy M : the no. u missed was 30.. better luck.. :P
2012-12-10 07:32:41 Santiago Palacio
Nice problem!
2011-09-20 22:34:39 Piotr KÄ…kol
@govardhan reddy - How about 32?
2011-09-20 22:34:39 Govardhan Reddy M
cant find 8 such numbers before 50. got only 7 : 12, 18, 20, 28, 44, 45, 48. please help if it does nt take out the fun of solving it ...
2011-09-20 22:34:39 Hendra Jaya
There are exactly 54454 such a number. Hence the answer should contain exactly 6050 lines. No wonder TEXT solution is impossible.
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.