# Practice on Toph

Participate in exhilarating programming contests, solve unique algorithm and data structure challenges and be a part of an awesome community.

# Find LCM

By TarifEzaz · Limits 1s, 512 MB

The Least Common Multiple of two integers $a$ and $b$ is the smallest integer $x$, such that $x$ is divided by both $a$ and $b$.

Given an integer $N$, you will have to determine whether it is possible to find another integer $y$ $(y > 1)$ other than $N$ itself, so that $LCM(y,N) = N$.

## Input

The only line of input will contain one integer $N ( 1 \leq N \leq 1000 )$.

## Output

Output a single line, Yes if it is possible to find one such integer $y$ for $N$, or No otherwise.

## Sample

InputOutput
4

Yes


### Statistics

94% Solution Ratio

alextodoranEarliest, 8M ago

omarfeFastest, 0.0s

alextodoranLightest, 131 kB

imamanik05Shortest, 77B