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-----
10

-----Sample Output-----
Yes

10 can be represented as, for example, 2 \times 5.

Difficulty: EASY

Solutions:
n = int(input())
flag = 0
for i in range(1, 10):
	for j in range(1, 10):
		if j * i == n:
			flag = 1
if flag == 1:
	print('Yes')
else:
	print('No')


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


N = int(input())
for i in range(9):
	for j in range(9):
		if (i + 1) * (j + 1) == N:
			print('Yes')
			exit()
print('No')


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


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


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


n = int(input())
count = 0
for a in range(1, 10):
	for b in range(1, 10):
		if a * b == n:
			count += 1
if count >= 1:
	print('Yes')
else:
	print('No')


n = int(input())
d = set([i * j for i in range(1, 10) for j in range(1, 10)])
print('Yes' if n in d else 'No')


n = int(input())
print('Yes' if any([n == x * y for x in range(1, 10) for y in range(1, 10)]) else 'No')


ans_list = [a * b for a in range(1, 10) for b in range(1, 10)]
print('Yes' if int(input()) in ans_list else 'No')


n = int(input())
product_list = list()
for i in range(1, 10):
	for j in range(1, 10):
		product_list.append(i * j)
if n in product_list:
	print('Yes')
else:
	print('No')


n = int(input())
ans = 'No'
for x in range(1, 10):
	if n / x in [1, 2, 3, 4, 5, 6, 7, 8, 9]:
		ans = 'Yes'
print(ans)


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


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


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


num = int(input())
range_num = [1, 2, 3, 4, 5, 6, 7, 8, 9]
for _ in range_num:
	if num / _ in range_num:
		print('Yes')
		break
else:
	print('No')


n = float(input())
print('Yes' if any([n / i in range(1, 10) and (n / i).is_integer() for i in range(1, 10)]) else 'No')


N = int(input())
num = [1, 2, 3, 4, 5, 6, 7, 8, 9]
for n in num:
	if N / n in num:
		print('Yes')
		exit()
print('No')


n = int(input())
k = [i * j for i in range(1, 10) for j in range(1, 10)]
if n in k:
	print('Yes')
else:
	print('No')


n = int(input())
s = set([x * y for x in range(1, 10) for y in range(1, 10)])
print('Yes' if n in s else 'No')


N = int(input())
Flag = False
for a in range(1, 9 + 1):
	for b in range(1, 9 + 1):
		if a * b == N:
			Flag = True
if Flag:
	print('Yes')
else:
	print('No')


N = int(input())
L = [1, 2, 3, 4, 5, 6, 7, 8, 9]
for i in range(1, 10):
	if N / i in L:
		print('Yes')
		exit()
print('No')


N = int(input())
flag = 0
for i in range(1, 10):
	for j in range(1, 10):
		if N == i * j:
			print('Yes')
			flag = 1
			break
	if flag == 1:
		break
if flag == 0:
	print('No')


N = int(input())
l = [i * j for i in range(1, 10) for j in range(1, 10)]
print('Yes' if N in l else 'No')


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


n = int(input())

def binary_search(l, target):
	left = 0
	right = len(l)
	while left < right:
		mid = (left + right) // 2
		if target == l[mid]:
			return True
		elif target < l[mid]:
			right = mid
		else:
			left = mid + 1
	return False
seki = [i * j for i in range(1, 10) for j in range(1, 10)]
seki.sort()
if binary_search(seki, n):
	print('Yes')
else:
	print('No')


n = int(input())
ans = -1
for i in range(1, 10):
	for j in range(1, 10):
		if n == i * j:
			ans = 1
			break
if ans == 1:
	print('Yes')
else:
	print('No')


x = set([i * j for i in range(1, 10) for j in range(1, 10)])
if int(input()) in x:
	print('Yes')
else:
	print('No')


N = int(input())
for i in range(1, 10):
	for x in range(1, 10):
		if i * x == N:
			print('Yes')
			return
else:
	print('No')


n = int(input())
cnt = 0
for i in range(1, 10):
	for j in range(1, 10):
		if i * j == n:
			print('Yes')
			return
else:
	print('No')


lst = [x * y for x in range(1, 10) for y in range(1, 10)]
if int(input()) in lst:
	print('Yes')
else:
	print('No')


n = int(input())
ans = False
for i in range(1, 10):
	for j in range(1, 10):
		if i * j == n:
			ans = True
if ans == True:
	print('Yes')
elif ans == False:
	print('No')


N = int(input())
L = [x * y for x in range(1, 10) for y in range(1, 10)]
if L.count(N) != 0:
	print('Yes')
else:
	print('No')


n = int(input())
y = 0
for i in range(1, 10):
	for j in range(1, 10):
		if i * j == n:
			y += 1
		else:
			pass
if y >= 1:
	print('Yes')
else:
	print('No')


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


print(['No', 'Yes'][int(input()) in [j * i for i in range(1, 10) for j in range(1, 10)]])


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


def resolve():
	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)
resolve()


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


import sys
n = int(input())
for a in range(1, 10):
	for b in range(1, 10):
		if a * b == n:
			print('Yes')
			return
print('No')


n = int(input())
print('Yes' if sum([1 for i in range(1, 10) if n % i == 0 and 0 < n // i < 10]) > 0 else 'No')


from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(500000)
INF = float('inf')
(YES, Yes, yes, NO, No, no) = ('YES', 'Yes', 'yes', 'NO', 'No', 'no')
(dy4, dx4) = ([0, 1, 0, -1], [1, 0, -1, 0])
(dy8, dx8) = ([0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1])

def inside(y, x, H, W):
	return 0 <= y < H and 0 <= x < W

def ceil(a, b):
	return (a + b - 1) // b

def sum_of_arithmetic_progression(s, d, n):
	return n * (2 * s + (n - 1) * d) // 2

def gcd(a, b):
	if b == 0:
		return a
	return gcd(b, a % b)

def lcm(a, b):
	g = gcd(a, b)
	return a / g * b

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

def main():
	solve()

def __starting_point():
	main()
__starting_point()


A = set()
for i in range(1, 10):
	for j in range(1, 10):
		A.add(i * j)
print(['No', 'Yes'][int(input()) in A])


def __starting_point():
	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)
__starting_point()


print('YNeos'[int(input()) not in {i * j for j in range(1, 10) for i in range(1, 10)}::2])


N = int(input())
productos = []

def mult(N):
	for i in range(1, 10):
		for n in range(1, 10):
			calc = n * i
			productos.append(calc)
	if N in productos:
		print('Yes')
	else:
		print('No')
mult(N)


def N(n):
	for i in range(1, 10):
		for j in range(1, 10):
			ans = i * j
			if ans == n:
				print('Yes')
				return 0
	print('No')
n = int(input())
N(n)


ls = []
for i in range(9):
	for j in range(9):
		ls.append(int((i + 1) * (j + 1)))
N = int(input())
if N in ls:
	print('Yes')
else:
	print('No')


n = int(input().strip())
print('Yes' if any((i * j == n for i in range(1, 10) for j in range(1, 10))) else 'No')


N = int(input())
nums = []
mul = []
for i in range(1, 9 + 1):
	if N % i == 0:
		nums.append(i)
	else:
		pass
for i in nums:
	for j in nums:
		mul.append(i * j)
if N in mul:
	print('Yes')
else:
	print('No')


q = set([a * b for a in range(1, 10) for b in range(1, 10)])
if int(input()) in q:
	print('Yes')
else:
	print('No')


n = int(input())
a = [(i + 1) * (j + 1) for i in range(9) for j in range(9)]
if n in a:
	print('Yes')
else:
	print('No')


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 == True:
	print('Yes')
else:
	print('No')


X = list(range(1, 10))
Y = {i * j for i in X for j in X}
if int(input()) in Y:
	print('Yes')
else:
	print('No')


def abc144b(n: int) -> str:
	for i in range(1, 9 + 1):
		if n % i == 0 and 0 < n // i < 10:
			return 'Yes'
	return 'No'
n = int(input())
print(abc144b(n))


n = int(input())
l = [i * j for i in range(1, 10) for j in range(1, 10)]
ans = 'No'
if n in l:
	ans = 'Yes'
print(ans)


print('Yes' if int(input()) in [i * m for i in range(1, 10) for m in range(1, 10)] else 'No')


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


n = int(input())
table = [1, 2, 3, 4, 5, 6, 7, 8, 9]
flag = False
for a in range(1, 10):
	b = n / a
	if b in table:
		flag = True
		break
print('Yes' if flag else 'No')


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


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


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


a = int(input())
b = [i * j for i in range(1, 10) for j in range(1, 10)]
print('Yes' if a in b else 'No')


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


N = int(input())
if N > 81:
	print('No')
else:
	state = 'No'
	for i in range(1, 10):
		for j in range(1, 10):
			if i * j == N:
				state = 'Yes'
				break
			if i * j > N:
				break
	print(state)


n = int(input())
l = list((v * h for h in range(1, 10) for v in range(1, 10)))
if n in l:
	print('Yes')
else:
	print('No')


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


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


a = list(set([i * j for i in range(1, 10) for j in range(1, 10)]))
n = int(input())
print('Yes' if n in a else 'No')


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