#29. 判断一个数是否是素数

判断一个数是否是素数

Description

Given an integern, print the sum. Input a positive number n to determine if it is a prime number. If so, output 'yes'. If not, output' no '.

Format

Input

a integer n, satisfying 0n327670\leq n\leq 32767 .

Output

if it is a prime number output 'yes'. If not, output' no '.

Samples

5
yes

Limitation

1s, 1024KiB for each test case.