S = int(input())

def divisor(n): 
    i = 1
    table = []
    while i * i <= n:
        if n%i == 0:
            table.append(i)
            table.append(n//i)
        i += 1
    table = list(set(table))
    return table

divisors = divisor(S)

#print(divisors)
n = len(divisors)

for i in range(int(n / 2+n % 2)):
    #print(divisors[i])
    if S // divisors[i] <= 9:
        result ="Yes"
    else:
        result ="No"
print(result)