Challenge 5 - Semi-Prime Numbers
Create a function that takes in an integer, `n`, and returns the count of semi-prime numbers from 1 to `n`, non-inclusive. A semi-prime number is a number that is the product of two prime numbers. Note that the numbers don't have to be distinct, meaning that 4 is a semi-prime number since it is 2 * 2.
Input:
Output: