##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
(Prime factors check)
An ugly number is a positive integer whose prime factors are only 2, 3, or 5. For example, 6 = 2 × 3 is ugly. But 14 = 2 × 7 is not (7 is a prime factor).
Given an integer n, return true if n is an ugly number, false otherwise. By convention, 1 is ugly (no prime factors).
Read the problem statement before continuing.
