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