DIV2  Divisors 2
Let N be a positive integer and d(N) be the number of positive divisors of N including 1 and N. Your task is to compute all N in [1,10^6] for which d(N)>3 and if M divides N then d(M) divides d(N) too.
Input
None.
Output
To make the problem less output related write out only every 108th of them, one per line.
Example
Output: 267 511 753 ... 999579 999781 999977
hide comments
Dmitry Boltrushko:
20110908 20:24:25
What is M? If for any M that divides N or for some M that divides M? Can M = 1?

Added by:  czylabsonasa 
Date:  20050524 
Time limit:  1s 
Source limit:  3333B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 
Resource:  Folklore 