## 24 hour archive: Problem

###
** 2916
- Free Numbers** ** 2916 - Free Numbers** ** 2916 - Free Numbers**

#### Description

Mr. Renicom want to solve a new problem in Number Theory. The formulation is as follow: given two square free numbers

An integer

*A*and*B*you must determine if the product of both is also square free number or not.An integer

*N*is square free if for every prime*p*that divide*N*then*p*^2 not divide*N*.
Mr. Renicom want to solve a new problem in Number Theory. The formulation is as follow: given two square free numbers

An integer

*A*and*B*you must determine if the product of both is also square free number or not.An integer

*N*is square free if for every prime*p*that divide*N*then*p*^2 not divide*N*.
Mr. Renicom want to solve a new problem in Number Theory. The formulation is as follow: given two square free numbers

An integer

*A*and*B*you must determine if the product of both is also square free number or not.An integer

*N*is square free if for every prime*p*that divide*N*then*p*^2 not divide*N*.#### Input specification

Input contains several tests cases. Each test case consist of two square free numbers

*A*and*B*(1 <=*A, B*< 2^31).
Input contains several tests cases. Each test case consist of two square free numbers

*A*and*B*(1 <=*A, B*< 2^31).
Input contains several tests cases. Each test case consist of two square free numbers

*A*and*B*(1 <=*A, B*< 2^31).#### Output specification

For each pair

*A*and*B*in the input you must print YES if the product is square free or NO in other case.
For each pair

*A*and*B*in the input you must print YES if the product is square free or NO in other case.*A*and

*B*(1 <=

*A, B*< 2^31).

#### Sample input

`1 1`

6 3

#### Sample output

`YES`

NO

#### Hint(s)

http://coj.uci.cu/24h/

http://coj.uci.cu/24h/

http://coj.uci.cu/24h/