Given an integer n, return true if n is an ugly number, and return false otherwise.

An ugly number is a positive integer whose prime factors are limited to 2, 3, and 5.

Note: 1 is considered an ugly number.

Constraints:

• $-2^{31} \leq$ n $\leq 2^{31} - 1$

Input: n = 8-int
Output: true-bool
Explanation: 8 = 2 × 2 × 2, so its only prime factor is 2 (allowed).

Input: n = 0-int
Output: false-bool
Explanation: Ugly numbers must be positive integers, and 0 is not positive.

Input: n = 75-int
Output: true-bool
Explanation: 75 = 3 × 5 × 5, so its only prime factors are 3 and 5 (allowed).

Input: n = 2147483647-int
Output: false-bool
Explanation: This number has a prime factor other than 2, 3, or 5, so it is not ugly.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.