from collections import defaultdict,Counter

def prime_factorial(n):
    p = []
    i = 2
    while i * i <= n:
        while n%i == 0:
            p.append(i)
            n = n // i
        i += 1
    if n != 1:
        p.append(n)
    return p


def main():
    
    
    N = int(input())
    C = defaultdict(int)
    if N < 3:
        print("No")
        exit()
    for i in range(2,N+1):
        p = prime_factorial(pow(2,i)-1)
        for x in p:
            C[x] += 1
            
    c = Counter(prime_factorial(pow(2,N+1)-1))
    for key in c.keys():
        if c[key] > C[key]:
            print("No")
            exit()
    print("Yes")
    
    
    
    
    
    
    



if __name__ == '__main__':
    main()