Divisibilityhard
0:00.0

An integer n>1n > 1 is called 'nearly-prime' if it is composite, and for any two of its proper divisors d1,d2d_1, d_2 (divisors other than 11 and nn), we have gcd(d1,d2)>1\gcd(d_1, d_2) > 1. How many such integers n50n \le 50 exist?