/*   2ms     */

 public class Solution {

     int quyu(int a,int q){

         while(a%q==0){

             a=a/q;

         }return a;

     }

     public boolean isUgly(int num) {

         if(num==0){

             return false;

         }

         num=quyu(num,2);

         num=quyu(num,3);

         num=quyu(num,5);

         if(num==1){

             return true;

         }else{

             return false;

         }

     }

 }

 /*     5ms   */

 public class Solution {

     public boolean isUgly(int num) {

         if(num==0) return false;

         while(num%2==0) num/=2;

         while(num%3==0) num/=3;

         while(num%5==0) num/=5;

         if(num==1) return true;

         else return false;

     }

 }

 /*************************************************************************

     > File Name: LeetCode263.c

     > Author: Juntaran

     > Mail: JuntaranMail@gmail.com

     > Created Time: Wed 18 May 2016 19:45:08 PM CST

  ************************************************************************/

 /*************************************************************************

     Ugly Number

     Write a program to check whether a given number is an ugly number.

     Ugly numbers are positive numbers whose prime factors

     only include 2, 3, 5. For example, 6, 8 are ugly while 14 is not ugly

     since it includes another prime factor 7.

     Note that 1 is typically treated as an ugly number.

  ************************************************************************/

 #include <stdio.h>

 int quyu( int num, int q )

 {

     while( num % q ==  )

     {

         num = num / q;

     }

     return num;

 }

 int isUgly(int num)

 {

     if( num <=  )

     {

         return ;

     }

     num = quyu( num,  );

     num = quyu( num,  );

     num = quyu( num,  );

     if( num ==  )

     {

         return ;

     }

     else

     {

         return ;

     }

 }

 int main()

 {

     int num = ;

     int ret = isUgly(num);

     printf("%d\n", ret);

 }