Problem:
 Score : 200 points    Problem Statement Having learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together.  Given an integer N , determine whether N can be represented as the product of two integers between 1 and 9 . If it can, print Yes ; if it cannot, print No .      Constraints  1 \leq N \leq 100  N is an integer.         Input Input is given from Standard Input in the following format:  N       Output If N can be represented as the product of two integers between 1 and 9 (inclusive), print Yes ; if it cannot, print No .        Sample Input 1 10      Sample Output 1 Yes  10 can be represented as, for example, 2 \times 5 .       Sample Input 2 50      Sample Output 2 No  50 cannot be represented as the product of two integers between 1 and 9 .       Sample Input 3 81      Sample Output 3 Yes

Solution (Python):
n = int(input())
ls = [i * j for i in range(10) for j in range(10)]
if n in ls:
    print('Yes')
else:
    print('No')

Solution (Python):
n = int(input())

for i in range(1, 10):
    for j in range(1, 10):
        if n == i * j:
            print('Yes')
            exit()
print('No')

Solution (Python):

import sys

n = int(sys.stdin.readline().strip())
s = set()
for i in range(1,10):
    for j in range(1,10):
        s.add(i*j)

if n in s: print('Yes')
else: print('No')

Solution (Python):
n = int(input())

for i in range(1,10):
    if n % i == 0 and n // i < 10:
        print('Yes')
        exit()
print('No')

Solution (Python):
n=int(input())
for i in range(1,10):
    for j in range(1,10):
        if n==i*j:
            print("Yes")
            exit()
print("No")

Solution (Python):
n = int(input())
c = "No"
for i in range(1,10):
    if n % i == 0 and n//i < 10:
        c = "Yes"
print(c)

Solution (Python):
a = int(input())
ans = 0
for i in range(10):
    for j in range(10):
        if i*j == a:
            ans = 1
print("Yes") if ans == 1 else print("No")

Solution (Python):
n = int(input())
for i in range(1, 10):
    for j in range(1, 10):
        if n == i * j:
            print('Yes')
            exit()
print('No')

Solution (Python):
def main():
    n = int(input())

    ans = "No"
    for i in range(1, 10):
        q, r = divmod(n, i)
        if 1 <= q <= 9 and r == 0:
            ans = "Yes"
            break

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
n=int(input())

ans=[]
for i in range(1,10):
    for q in range(1,10):
      ans.append(i*q)

if n in ans:
    print("Yes")
else:
    print("No")

Solution (Python):
s = set()
for i in range(1,10):
    for j in range(1,10):
        s.add(i*j)
print('Yes' if int(input()) in s else 'No')

Solution (Python):
N = int(input())
for i in range(1,10):
    for k in range(1,10):
        if i * k == N:
            print("Yes")
            exit()
print("No")

Solution (Python):
N = int(input())

vA = [i*j for i in range(1,10) for j in range(1,10)]

if N in vA:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys
MAX_INT = int(10e10)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

N = I()

for i in range(1, 10):
  if N%i == 0:
    tmp = N//i
    if tmp < 10:
      print("Yes")
      exit()
else:
  print("No")

Solution (Python):
n = int(input())

ans = False

for i in range(1, 10) :
    for j in range(1, 10) :
        if n == i * j :
            ans = True

if ans :
    print('Yes')
else :
    print('No')

Solution (Python):
import sys
N=int(input())
for i in range(1,10):
  for j in range(1,10):
    if i*j==N:
      print('Yes')
      sys.exit()
print('No')

Solution (Python):
N=int(input())
for _ in range(1, 10):
    for i in range(1,10):
        if N==_*i:
            print("Yes")
            exit()
print("No")

Solution (Python):
n=int(input())
flg = False
for i in range(1,10):
    for j in range(1,10):
        if i*j==n:
            flg = True
if flg:
    print('Yes')
else:
    print('No')

Solution (Python):
N = int(input())

for i in range(1,9+1):
    if N % i == 0 and N // i < 10:
        print('Yes')
        break
else:
    print('No')

Solution (Python):
n = int(input())

flag = False
for i in range(1, 10):
    if n % i == 0 and 0 < n//i < 10:
        flag = True
        break

if flag:
    print('Yes')
else:
    print('No')

Solution (Python):
N = int(input())

for i in range(1, 10):
    for j in range(1, 10):
        if i * j == N:
            print("Yes")
            exit()

print("No")

Solution (Python):
n=int(input())

def solve():
    for i in range(1,10):
        for j in range(1,10):
            if(i*j==n):
                print("Yes")
                return
    print("No")

solve()

Solution (Python):

from __future__ import division, print_function

import os
import sys
from io import BytesIO, IOBase

if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip


def main():
    m = set()
    for i in range(1, 10):
        for j in range(1, 10):
            m.add(i * j)

    n = int(input())

    print('Yes' if n in m else 'No')




BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()


if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)

input = lambda: sys.stdin.readline().rstrip("\r\n")



if __name__ == "__main__":
    main()

Solution (Python):
n = int(input())

x = []
for i in range(1, 10):
    for j in range(1, 10):
        x.append(i*j)

if n in x:
    print("Yes")
else:
    print("No")

Solution (Python):
n=int(input())
ans=[i*j for i in range(1,10) for j in range(1,10)]
if n in ans:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
for i in range(1, 10):
    for j in range(1, 10):
        if i*j == N:
            print('Yes')
            exit()
print('No')

Solution (Python):
n = int(input())
for i in range(1, 10):
    if n % i == 0 and n/i >= 1 and n/i <= 9:
        print("Yes")
        break
else:
    print("No")

Solution (Python):
N = int(input())

for i in range(9, 0, -1):
  if N % i == 0 and N / i < 10:
    print("Yes")
    break
else:
  print("No")

Solution (Python):
N = int(input())
A = [i for i in range(1,10)]
B = [i for i in range(1,10)]

ans = []
for a in A:
    for b in B:
        ans.append(a*b)
ans = set(ans)
if N in ans:
    print("Yes")
else:
    print("No")

Solution (Python):
n=int(input())
flag=False
for i in range(1, 10):
    if n%i==0 and n//i<=9:
        flag=True
if flag:
    print('Yes')
else:
    print('No')

Solution (Python):

def nums():
    return list(map(int,input().split(" ")))
def num():
    return int(input())

"""
a,b = nums()
if a <= 9 and b <= 9:
    print(a * b)
else:
    print(-1)
"""

n = num()
qq = []
for i in range(10):
    for j in range(10):
        qq.append(i * j)
if n in qq:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
ans = 0
for i in range(1,10):
    for j in range(1,10):
        if i*j == N:
            ans += 1
if ans>0:
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
for i in range(1, 10):
    if n % i == 0 and 0 < n // i < 10:
        print('Yes')
        break
else:
    print('No')

Solution (Python):
s = {i * j for i in range(1, 10) for j in range(1, 10)}
print("Yes" if int(input()) in s else "No")

Solution (Python):
def test():
    n = int(input())
    for i in range(10):
        for j in range(10):
            if i * j == n:
                print("Yes")
                return
    print("No")


if __name__ == "__main__":
    test()

Solution (Python):
flag = False
n = int(input())
for i in range(1,10):
	if n%i == 0 :
		if 1<=int(n/i)<=9 :
			flag = True
			break
if not flag :
	print("No")
else :
	print("Yes")

Solution (Python):
n = int(input())
for i in range(1,10):
  for j in range(1,10):
    if i * j == n:
      print("Yes")
      exit()
print("No")

Solution (Python):
n=int(input())
for i in range(1,10):
    if n%i==0:
        a=n//i
        if 1<=a<=9:
            print("Yes")
            break
else:
    print("No")

Solution (Python):
n = int(input())
f = False
for i in range(1, 10):
	for j in range(1, 10):
		if i * j == n:
			f = True
print("Yes" if f else "No")

Solution (Python):
N = int(input())
for i in range(1, 10):
    if N % i == 0 and 1 <= N // i <= 9:
        print('Yes')
        break
else:
    print('No')

Solution (Python):
N = int(input())

for a in range(1, 10):
    if N % a != 0:
        continue

    if N // a > 9:
        continue

    print('Yes')
    break
else:
    print('No')

Solution (Python):



import sys

a=int(input())

for i in range(10):
    for j in range(10):
        if i * j == a:
            print("Yes")
            sys.exit()
print("No")

Solution (Python):
import sys
n = int(input())
for i in range(1,10):
  for j in range(1,10):
    if (i*j == n):
      print('Yes')
      sys.exit(0)
print('No')

Solution (Python):
N = int(input())

def check(N):
	for i in range(1, 10):
		if N % i == 0 and N // i < 10:
			print("Yes")
			return
	print("No")

check(N)

Solution (Python):
n = int(input())
s = set()
for i in range(1,10):
  for j in range(1,10):
    s.add(i*j)
if n in s:
  print('Yes')
else:
  print('No')

Solution (Python):
words = lambda t : list(map(t, input().split()))
n = int(input())

ans = False
for i in range(1,10):
    for j in range(1,10):
        if n == i*j:
            ans = True

if ans:
    print("Yes")
else:
    print("No")

Solution (Python):



def ri():
    return int(input())

def rl():
    return list(input().split())

def rli():
    return list(map(int, input().split()))

def main():
    n = ri()
    for a in range(1, 10):
        for b in range(1, 10):
            if a*b == n:
                print("Yes")
                return
    print("No")


if __name__ == '__main__':
    main()

Solution (Python):
n=int(input())
a="No"
for i in range(10):
    for j in range(10):
        if i*j==n:
            a="Yes"
print(a)

Solution (Python):
N=int(input())
ans=0
for i in range(9):
  for j in range(9):
    if((i+1)*(j+1)==N):
      ans=1
if(ans):
  print("Yes")
else:
  print("No")

Solution (Python):

import sys
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = lambda *something : print(*something) if DEBUG else 0
DEBUG = False
def main(given = sys.stdin.readline):
    input = lambda : given().rstrip()
    LMIIS = lambda : list(map(int,input().split()))
    II = lambda : int(input())
    XLMIIS = lambda x : [LMIIS() for _ in range(x)]

    N = int(input())
    for i in range(1,10):
        if N % i == 0:
            if N // i < 10:
                print('Yes')
                return
    print('No')



if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())

flag=False
for i in range(1,10):
    for j in range(1,10):
        if N==i*j:
            flag=True

if flag:
    print("Yes")
else:
    print("No")

Solution (Python):
N=int(input())
flg=False
for i in range(10):
    for j in range(10):
        if N==i*j: flg=True
print("Yes" if flg else "No")

Solution (Python):
N=int(input())

can = False
for a in range(10):
    for b in range(10):
        if a*b == N:
            can = True
            break

if can:
    print('Yes')
else:
    print('No')

Solution (Python):
n = int(input())
for i in range(1,10):
    for j in range(1,10):
        if n == i*j:
            print('Yes')
            exit()
print('No')

Solution (Python):
def main():
    N = int(input())
    ans = set()
    for i in range(1, 10):
        for j in range(1, 10):
            ans.add(i*j)
    print("Yes" if N in ans else "No")


if __name__ == "__main__":
    main()

Solution (Python):
N = int(input())
s = set()
for i in range(1, 10):
    for j in range(1, 10):
        s.add(i*j)
if (N in s):
    print('Yes')
else:
    print('No')

Solution (Python):
n = int(input())
for i in range(1,10):
  for j in range(1,10):
    if i*j == n:
      print("Yes")
      exit()
    else:
      continue
print("No")

Solution (Python):
N = int(input())
flag = False
for i in range(1, 10):
    if N % i == 0 and N // i <= 9:
        flag = True
        break
if flag:
    print('Yes')
else:
    print('No')

Solution (Python):
n = int(input())
lis = set()
for i in range(1, 10):
    for j in range(1, 10):
        lis.add(i*j)
if n in lis:
    print("Yes")
else:
    print("No")

Solution (Python):
def main():
    n = input()
    for i in xrange(1, 10):
        for j in xrange(1, 10):
            if i * j == n:
                print('Yes')
                return
    print('No')

main()

Solution (Python):
n = int(input())
for a in range(1, 10):
    for b in range(1, 10):
        if n == a * b:
            print('Yes')
            exit(0)
print('No')

Solution (Python):
N = int(input())
for i in range(1, 10):
    if N % i == 0:
        if N // i < 10:
            print("Yes")
            exit(0)
print("No")

Solution (Python):
import sys
sys.setrecursionlimit(10**7)
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return sys.stdin.readline().strip()
INF = 10 ** 18
MOD = 10 ** 9 + 7

debug = True
debug = False

def dprint(*objects):
    if debug == True:
        print(*objects)

def warshall_floyd(d):
    
    n = len(d)
    for k in range(n):
        for i in range(n):
            for j in range(n):
                d[i][j] = min(d[i][j],d[i][k] + d[k][j])
    return d

def solve():
    N = II()

    for i in range(1, 10):
        for j in range(i, 10):
            if N == i*j:
                print('Yes')
                return
    print('No')

solve()

Solution (Python):
N = int(input())
for i in range(1, 10):
    if N % i == 0:
        if 1 <= N//i <= 9:
            print("Yes")
            exit()
print("No")

Solution (Python):
n = int(input())
ans = "No"
for i in range(1,10):
    for j in range(1,10):
        if n==i*j:
            ans = "Yes"
            break

print(ans)

Solution (Python):
N = int(input())
a = [1]
ans = "No"
for i in range(1,10):
    for j in range(1,10):
        a.append(i*j)
if a.count(N)>0:
    ans ="Yes"
print(ans)

Solution (Python):
n = int(input())

for i in range(1, 10):
    for j in range(1, 10):
        if i * j == n:
            print('Yes')
            exit()

print('No')

Solution (Python):
n = int(input())

for i in range(1, 10):
    for j in range(1, 10):
        if i*j == n:
            print("Yes")
            exit()
print("No")

Solution (Python):
N = int(input())
valid = False
for i in range(1,10):
    if N%i == 0:
        if N//i < 10:
            valid = True
            break
print('Yes' if valid else 'No')

Solution (Python):
import sys
input = sys.stdin.readline

def main():
    N = int(input())
    ans = []
    for i in range(1, 10):
        for j in range(1, 10):
           ans.append(i * j)

    if N in ans:
        print("Yes")
    else:
        print("No")

    

if __name__ == '__main__':
    main()

Solution (Python):

n = int(input())
ans = False
for i in range(1, 10):
    if n % i == 0:
        if n // i < 10:
            ans = True
print(["No", "Yes"][ans])

Solution (Python):
n=int(input())
for i in range(1,10):
    if 1<=n//i<10 and (n//i)*i==n:
        print("Yes")
        break
else:
    print("No")

Solution (Python):
N = int(input())
for i in range(1,10):
  a = N % i
  b = N // i
  if(a == 0 and b < 10):
    print("Yes")
    exit()
print("No")

Solution (Python):
def main():
    N = int(input())

    ans = 'No'
    for i in range(1, 10):
        for j in range(1, 10):
            r = i * j
            if r == N:
                ans = 'Yes'

    print(ans)

if __name__ == "__main__":
    main()

Solution (Python):
n = int(input())

for i in range(1,10):
    for j in range(1,10):
        if n == i*j:
            print("Yes")
            exit()
print("No")

Solution (Python):
import sys
input = sys.stdin.readline


def main():
    N = int(input())
    for i in range(1, 10):
        for j in range(1, 10):
            if i*j == N:
                print("Yes")
                return
    print("No")


if __name__ == '__main__':
    main()

Solution (Python):
import sys
input = sys.stdin.readline

l=[]
for i in range(1,10):
    for j in range(1,10):
        l.append(i*j)
n=int(input())
if n in l:
    print("Yes")
else:
    print("No")

Solution (Python):

import sys
input = lambda: sys.stdin.readline()[:-1]
sys.setrecursionlimit(10**8)
inf = float('inf')
mod = 10**9+7

n=int(input())
for i in range(1,10):
    for j in range(1,10):
        if n==i*j:
            print('Yes')
            exit()

print('No')

Solution (Python):
n=int(input())
def ans():
    for i in range(1,10):
        for j in range(1,10):
            if i*j==n:
                print("Yes")
                return
    print("No")
    
ans()

Solution (Python):
N = int(input())
for i in range(1, 10):
    if N % i == 0:
        if int(N / i) < 10:
            print("Yes")
            exit(0)
print("No")

Solution (Python):
N=int(input())
L=[]
for i in range(1,10):
    for j in range(1,10):
        L.append(i*j)
if N in L:
    print('Yes')
else:
    print('No')

Solution (Python):

import sys
input = sys.stdin.buffer.readline


from collections import defaultdict

INF = float("inf")

def getlist():
	return list(map(int, input().split()))


def main():
	N = int(input())
	judge = "No"
	for i in range(1, 10):
		for j in range(1, 10):
			if N == i * j:
				judge = "Yes"
				break
	print(judge)

if __name__ == '__main__':
	main()

Solution (Python):
n = int(input())

for i in range(1, 10):
    for j in range(1, 10):
        if i * j == n:
            print('Yes')
            exit()
print('No')

Solution (Python):
a = int(input())
for i in range(1,10):
    for j in range(1,10):
        if i*j == a:
            print("Yes")
            exit()
print("No")

Solution (Python):
n=int(input())
for i in range(1, 10):
    for j in range(1, 10):
        if n==i*j:
            print("Yes")
            quit()
print("No")

Solution (Python):
import sys
N = int(input())

for i in range(1, 10):
    for j in range(1, 10):
        if i * j == N:
            print('Yes')
            sys.exit()
print('No')

Solution (Python):

from fractions import gcd

from math import factorial as f

from math import ceil,floor,sqrt

from sys import exit

from copy import deepcopy
import numpy as np

import bisect
import re


ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))



def main():
    a = ii()
    for i in range(1,10):
        for j in range(1,10):
            if a == i*j:
                print('Yes')
                exit()
    print('No')

main()

Solution (Python):
n = int(input())
ans = "No"
for i in range(1,10):
    if n % i == 0 and n//i <= 9:
        ans = "Yes"
print(ans)

Solution (Python):
N = int(input())
answer = 'No'
for i in range(1, 10):
    for j in range(1, 10):
        if i * j == N:
            answer = 'Yes'
print(answer)

Solution (Python):
a = int(input())
seen = set()
for i in range(1,10):
    for k in range(1,10):
        seen.add(i*k)
if a in seen:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
for i in range(1, 10):
    for j in range(1, 10):
        if i * j == N:
            print("Yes")
            exit()

print("No")

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))

sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = INT()
for i in range(1, 10):
  for j in range(1, 10):
    if i * j == N:
      print("Yes")
      exit()
print("No")

Solution (Python):


import array
import math
import os
import sys


def main():
    N = read_int()
    for x in range(1, 10):
        for y in range(x, 10):
            if x * y == N:
                print('Yes')
                return
    print('No')





DEBUG = 'DEBUG' in os.environ


def inp():
    return sys.stdin.readline().rstrip()


def read_int():
    return int(inp())


def read_ints():
    return [int(e) for e in inp().split()]


def dprint(*value, sep=' ', end='\n'):
    if DEBUG:
        print(*value, sep=sep, end=end)


if __name__ == '__main__':
    main()

Solution (Python):
n=int(input())
for i in range(9):
    i+=1
    if n%i==0 and n//i<=9:
        print("Yes")
        exit()
    else:
        continue
print("No")

Solution (Python):

import sys
sys.setrecursionlimit(10000)
INF = 1<<32

YES = "Yes"  
NO = "No"  

def solve(N: int):
    f = True
    for i in range(1,10):
        if(N%i == 0 and N//i <= 9):
            f = True
            break
        else:
            f = False

    if f:
        print(YES)
    else:
        print(NO)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    solve(N)

if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
for i in range(1, 10):
    for j in range(1, 10):
        if i*j == n: print("Yes"); exit()
print("No")

Solution (Python):
n = int(input())
l = []
for i in range(10):
    for j in range(10):
        if i*j not in l:
            l.append(i*j)

if n in l:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
flag = 0
for i in range(1, 10):
    for j in range(1, 10):
        if N == i*j:
            flag = 1

if flag == 1:
    print("Yes")
else:
    print("No")

Solution (Python):


N=int(input())

for i in range(1,10):
    if N%i==0:
        if N//i>9:
            pass
        else:
            print("Yes")
            exit()

print("No")

Solution (Python):
def main():
    n=int(input())
    s=set()
    for i in range(1,10):
        for j in range(1,10):
            s.add(i*j)
    if n in s:
        print("Yes")
    else:
        print("No")
    
main()

Solution (Python):
N=int(input())
List=[a*b for a in range(1,10) for b in range(1,10)]
if N in List:
    print("Yes")
else:
    print("No")

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor, atan2
from operator import mul
from functools import reduce
sys.setrecursionlimit(10**8)

INF = float('inf')
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 1000000007


def main():
    n = I()
    for i in range(1, 10):
        for j in range(1, 10):
            if i * j == n:
                return 'Yes'
    else:
        return 'No'



print(main())

Solution (Python):
n = int(input())
ans = False
for a in range(1, 10):
    if n % a == 0:
        b = n // a
        if 1 <= b and b <= 9:
            ans = True
print('Yes' if ans else 'No')

Solution (Python):
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
mod = 10**9+7
Max = sys.maxsize
def l(): 
    return list(map(int,input().split()))
def m(): 
    return map(int,input().split())
def onem(): 
    return int(input())
def s(x): 
    a = []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): 
    return " ".join(map(str,x))
def max2(x): 
    return max(map(max,x))
def In(x,a): 
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False



n = onem()

for i in range(1,10):
    for j in range(1,10):
        if i*j == n:
            print("Yes")
            exit()

print("No")

Solution (Python):
N = int(input())
for i in range(1, 10):
    if N % i == 0 and N // i < 10:
        print('Yes')
        break
else:
    print('No')

Solution (Python):
N = int(input())
flag = False
for i in range(1, 10):
    for j in range(1, 10):
        if N == i*j:
            flag = True
if flag:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys
def input():
    return sys.stdin.readline()[:-1]
l=[]
for i in range(1,10):
    for j in range(i,10):
        l.append(i*j)
N=int(input())
if N in l:
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
for i in range(1, 10):
  for j in range(1, 10):
    if i * j == n:
      print("Yes")
      exit()
print("No")

Solution (Python):
n=int(input())
for i in range(10):
    for j in range(10):
        if i*j==n:
            print('Yes')
            exit()
print('No')

Solution (Python):
n = int(input())
flg = False
for i in range(1,10):
    for j in range(1,10):
        if i * j == n:
            flg = True
if flg:
    print("Yes")
else:
    print("No")

Solution (Python):
N=int(input())
for i in range(1,10):
    for j in range(1,10):
        if i*j==N:
            print("Yes")
            exit()
print("No")

Solution (Python):
N = int(input())
for i in range(1, 10):
  if N % i:
    continue
  if N // i < 10:
    print('Yes')
    break
else:
  print('No')

Solution (Python):
from sys import stdin


def input():
    return stdin.readline()[:-1]


def intput():
    return int(input())


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


def intsput():
    return map(int, sinput())



table = [False] * 1000


for a in range(1, 10):
    for b in range(1, 10):
        table[a * b] = True


n = intput()

if table[n]:
    print("Yes")
else:
    print("No")

Solution (Python):
A=[]
for i in range(10):
    for j in range(10):
        A.append(i*j)

print("Yes" if int(input()) in A else "No")

Solution (Python):










n = int(input())

st = {i * j for i in range(1, 10) for j in range(1, 10)}

if n in st:
    print('Yes')
else:
    print('No')

Solution (Python):


def main():
    N = int(input())
    for i in range(1,10):
        for ii in range(1,10):
            seki = i * ii
            if N == seki:
                print('Yes')
                return
    print('No')

if __name__ == "__main__":
    main()

Solution (Python):
N = int(input())
ret = "No"
for i in range(1,10):
    for j in range(1, 10):
        if i * j == N:
            ret = "Yes"
print(ret)

Solution (Python):
N = int(input())
l = []
for i in range(1, 10):
    for j in range(1, 10):
        l.append(i*j)
if N in l:
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())

A = set()
for i in range(1, 10):
    for j in range(1, 10):
        A.add(i * j)

if n in A:
    print("Yes")
else:
    print("No")

Solution (Python):
import queue

"""
N = int(input())



A = []
for i in range(N):
	A.append(int(input()))

print(A)

"""
N = int(input())
s = "No"
for i in range(1,10):
	for j in range(1,10):
		if i*j==N:
			s = "Yes"
print(s)

Solution (Python):
n = int(input())

ans = "No"
for i in range(1,10):
    for j in range(1,10):
        if i*j == n:
            ans = "Yes"

print(ans)