import sys

import math

import bisect

 

 

sys.setrecursionlimit(1000000000)

def input():

    return sys.stdin.readline().strip()

 

def iinput():

    return int(eval(input()))

 

def finput():

    return float(eval(input()))

 

def tinput():

    return input().split()

 

def rinput():

    return list(map(int, tinput()))

 

def rlinput():

    return list(rinput())

 

def modst(a, s):

    res = 1

    while s:

        if s % 2:

            res *= a

        a *= a

        s //= 2

    return res



 

def main():

    n = iinput()

    for i in range(1, 10):

        for o in range(1, 10):

            if o * i == n:

                print("Yes")

                return 0

    print("No")

main()
possible = False

a = int(eval(input()))

for m in range(1, 10):

    if a % m == 0 and a / m < 10:

        print("Yes")

        possible = True

        break

if not possible:

    print("No")

import sys
import math
import bisect

sys.setrecursionlimit(1000000000)


def input():
    return sys.stdin.readline().strip()


def iinput():
    return int(eval(input()))


def finput():
    return float(eval(input()))


def tinput():
    return input().split()


def rinput():
    return list(map(int, tinput()))


def rlinput():
    return list(rinput())


def modst(a, s):
    res = 1
    while s:
        if s % 2:
            res *= a
        a *= a
        s //= 2
    return res


def main():
    n = iinput()
    for i in range(1, 10):
        for o in range(1, 10):
            if o * i == n:
                print("Yes")
                return 0
    print("No")


main()

possible = False
a = int(eval(input()))
for m in range(1, 10):
    if a % m == 0 and a / m < 10:
        print("Yes")
        possible = True
        break
if not possible:
    print("No")

-import sys -import math -import bisect - -sys.setrecursionlimit(1000000000) - - -def input(): -    return sys.stdin.readline().strip() - - -def iinput(): -    return int(eval(input())) - - -def finput(): -    return float(eval(input())) - - -def tinput(): -    return input().split() - - -def rinput(): -    return list(map(int, tinput())) - - -def rlinput(): -    return list(rinput()) - - -def modst(a, s): -    res = 1 -    while s: -        if s % 2: -            res *= a -        a *= a -        s //= 2 -    return res - - -def main(): -    n = iinput() -    for i in range(1, 10): -        for o in range(1, 10): -            if o * i == n: -                print("Yes") -                return 0 +possible = False +a = int(eval(input())) +for m in range(1, 10): +    if a % m == 0 and a / m < 10: +        print("Yes") +        possible = True +        break +if not possible: - - -main()