Pigeonhole and Extremal Arguments · Medium problem

Claim: every integer $n \ge 2$ is either prime or a product of exactly two primes. A smallest-counterexample check looks for the least failure. What is it?