I guess the answer is D.
My approach is as follows:
For the first statement, if there are 4 different prime numbers as factors of 2n, then removing 2 from 2n (2 itself being prime) leaves us with 3 different factors of n.
For the second statement, if there are if there are 4 different prime numbers as factors of n^2, then removing n from n^2 (dividing n^2 by n) leaves us with 3 different factors of n.
Hence, both are sufficient.
Waiting for the OA?