impot math def is_prime(n): if n==1: return False for x in range(2,int(math.sqrt(n))+1): if n%x==0: return False return True m = int(input()) res = is_prime(m) if res==True: print("Yes") else: print("No")