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):


import itertools


def judge(n):
    for a, b in itertools.product(range(1, 10), repeat=2):
        if a * b == n:
            return True
    else:
        return False


def main():
    n = int(input())
    print("Yes" if judge(n) else "No")


if __name__ == "__main__":
    main()

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

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

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

Solution (Python):
n = int(input())
kuku = []
for i in range(1,10):
         for j in range(i,10):
                  kuku.append(i*j)
for k in range(len(kuku)):
         if n == kuku[k]:
                  print("Yes")
                  exit()
print("No")

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

Solution (Python):
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")

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

cnt = 0
for i in range(1,10):
    if n % i ==0 and (n/i) < 10:
        cnt += 1
        break
    else:
        pass

if cnt > 0:
    print("Yes")
else:
    print("No")

Solution (Python):
import itertools

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

if __name__ == "__main__":
    main()

Solution (Python):
flag = False
n = int(input())
for i in range(9):
    for j in range(9):
        if n == (i+1)*(j+1):
            flag = True

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

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

for i in range(9, 0, -1):
    if n % i == 0:
        n /= i
        break

if n <= 9:
    print('Yes')
else:
    print('No')

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

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

Solution (Python):

def f(a):
    valid = tuple(range(1, 9 + 1))
    for x in valid:
        if a % x == 0 and a // x in valid:
            return "Yes"
    return "No"

a = int(input())
ans = f(a)
print(ans)

Solution (Python):
kuku = set([i * j for i in range(1, 10) for j in range (1, 10)])
def main():
    a = int(input())
    print('Yes' if a in kuku else 'No')


if __name__ == '__main__':
    main()

Solution (Python):

N=int(input())
t=False

ll=[i for i in range(1,10)]

for i in range(1,10):
    if N/i==N//i:
        if N//i in ll:
            t=True
if t:
    print("Yes")
else:
    print("No")

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

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

ans = False
for x in range(1,10):
    if N%x == 0:
        if N//x <= 9:
            ans = True
            break
if ans:
    print("Yes")
else:
    print("No")

Solution (Python):
def solve_b(c):
    res = "No"
    for a in range(1, 10):
        if c % a == 0 and c // a < 10:
            res = "Yes"
    return res


def main():
    
    c = int(input())
    res = solve_b(c)
    print(res)


def test():
    assert solve_b(10) == "Yes"
    assert solve_b(50) == "No"
    assert solve_b(81) == "Yes"


if __name__ == "__main__":
    test()
    main()

Solution (Python):
N=int(input())
f=0
for a in range(10):
  for b in range(10):
    if a*b==N:
      print("Yes")
      f=1
      break
  if f==1:
    break
if f==0:
  print("No")

Solution (Python):

import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)
input = sys.stdin.readline
INF = 2**62-1


def read_int():
    return int(input())


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


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(N):
    cand = set(a * b for a, b in combinations_with_replacement(range(1, 10), 2))
    if N in cand:
        return 'Yes'
    return 'No'


def main():
    N = read_int()
    print(slv(N))


if __name__ == '__main__':
    main()

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

Solution (Python):


N = int(input())

flag = False
for i in range(1, 10):
    M = N / i
    if M == int(M) and 1 <= M <= 9:
        flag = True
        break

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

Solution (Python):
n = int(input())
kk = []

for i in range(1, 10):
    for j in range(1, 10):
        kk.append(i * j)

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

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

Solution (Python):
N = int(input().strip())
check = False

for i in range(1,10):
    
    if N % i == 0:
        x = N/i
        if x >= 1 and x <= 9:
            check = True

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

Solution (Python):
import sys

input = sys.stdin.readline


class AtCoder:
    def main(self):
        N = int(input())

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



if __name__ == '__main__':
    AtCoder().main()

Solution (Python):
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")

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

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

Solution (Python):
def resolve():
    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__':
    resolve()

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())
flag = 0
for i in range(1,10):
    for j in range(1,10):
        if i*j == n:
            flag = 1
print('Yes' if flag == 1 else 'No')

Solution (Python):




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

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

  print('No')


if __name__ == '__main__':
  main()

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

Solution (Python):
def solve():
    n = int(input())
    for i in range(1,10):
        if n%i == 0 and (n//i) in (1,2,3,4,5,6,7,8,9):
            return 'Yes'
    else:
        return 'No'

if __name__ == '__main__':
    print(solve())

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):
    if N%i==0 and N//i<10:
        flag = True
        break

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

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

Solution (Python):

import sys

import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *

readl= lambda: list(map(int, sys.stdin.readline().split()))
readt= lambda: tuple(map(int, sys.stdin.readline().split()))
read = lambda: sys.stdin.readline().rstrip()
readi = lambda: int(read())
readmi = lambda: map(int, sys.stdin.readline().split())
readms = lambda: map(str, sys.stdin.readline().split())

n = readi()

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())
L = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 16, 18, 15, 21, 24, 27, 20, 28, 32, 36,
     15, 25, 30, 35, 40, 45, 36, 42, 48, 54, 49, 56, 63, 64, 72, 81]

if N in L:
  print('Yes')
else:
  print('No')

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

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

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

else:
    print("No")

Solution (Python):
import sys


def main():
    n = int(sys.stdin.readline().strip())

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


main()

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())

kuku = []

for i in range(9):
    for j in range(9):
        kuku.append((i+1) * (j+1))

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

Solution (Python):
import sys
read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
inputs= sys.stdin.buffer.readlines























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")
	
	
	
	




if __name__ == '__main__':
	main()

Solution (Python):
from sys import stdout
printn = lambda x: stdout.write(x)
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split()) 
DBG = True 
BIG = 999999999
R = 10**9 + 7

def ddprint(x):
  if DBG:
    print(x)

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

Solution (Python):


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

N = int(input())

if N in l:
    print('Yes')
else:
    print('No')

Solution (Python):
from sys import stdin
from itertools import accumulate, dropwhile, takewhile, groupby
import bisect
import copy




'''
条件に合うものを絞り込む
data = [1, 2, 3]
s = [x for x in data if x % 3 == 0]
'''

'''
文字配列を数値に
l_si = ['-10', '0', '100']

l_si_i = [int(s) for s in l_si]
'''

'''
a = [2, 4, 6, 8]
b = [3, 6, 9]

print(list(set(a) | set(b)))  
print(list(set(a) & set(b)))  
'''

'''
N = int(stdin.readline().rstrip())
A = [int(x) for x in stdin.readline().rstrip().split()]
count = 0
while len([x for x in A if x % 2 == 0]) == N:
    A = list(map(lambda y: y / 2, A))
    count += 1
print(count)
'''

'''
.append(要素)
.extend(要素)
.insert(場所,要素)
del 配列名[場所]
-1で末尾で末尾から一つ前
'''
'''
間に空白追加
' '.join(lis)
'''
'''
copy.copy(配列名)
'''
'''
sort()
sorted(reverse=true)
'''
'''
2分探索
bisect.bisect_left(リスト, 要素)
'''
tes = False
num = int(stdin.readline().rstrip())
for k1 in range(1, 10):
    for k2 in range(1, 10):
        if (num == k1 * k2):
            print('Yes')
            tes = True
            break
    if (tes):
        break
if (not tes):
    print('No')

Solution (Python):
import sys
N = int(input())
for i in range(1,10):
    if N % i == 0 and N // i <= 9:
        print('Yes')
        sys.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
    if i == 9:
        print("No")

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

Solution (Python):
n=int(input())
l=[1, 2, 3, 4, 5, 6, 7, 8, 9, 2, 4, 6, 8, 10, 12, 14, 16, 18, 3, 6, 9, 12, 15, 18, 21, 24, 27, 4, 8, 12, 16, 20, 24, 28, 32, 36, 5, 10, 15, 20, 25, 30, 35, 40, 45, 6, 12, 18, 24, 30, 36, 42, 48, 54, 7, 14, 21, 28, 35, 42, 49, 56, 63, 8, 16, 24, 32, 40, 48, 56, 64, 72, 9, 18, 27, 36, 45, 54, 63, 72, 81]
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 n == i * j:
            print("Yes")
            exit()
print("No")

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

f=False
for i in range(9):
    for j in range(9):
        ans=(i+1)*(j+1)
        if ans== N:
            f=True
            break
if f:
    print("Yes")
else:
    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):
import sys
n = int(input())
for i in range(1, 10):
    for j in range(1, i+1):
        if n == i*j:
            print("Yes")
            sys.exit()
print("No")

Solution (Python):
from bisect import bisect_left,bisect_right
import sys
def input(): return sys.stdin.readline().strip()

def main(bisect_left=bisect_left, bisect_right=bisect_right):
    n = int(input())
    for i in range(1,10):
        for j in range(1,10):
            if i * j == n:
                print('Yes')
                return
    print('No')
main()

Solution (Python):
import sys
sys.setrecursionlimit(1000000000)
ii = lambda: int(input())
mis = lambda: map(int,input().split())
lmis = lambda: list(mis())
INF = float('inf')

def main():
    N=ii()
    for i in range(1,10):
        for j in range(1,10):
            if i*j==N:
                print('Yes')
                exit()
    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())
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())
ans="No"
for i in range(1,10):
  if n%i==0:
    if n//i<10:
      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())
ans=False
for i in range(1,10):
    for j in range(1,10):
        if i*j==n:
            ans=True
if ans:
    print("Yes")
else:
    print("No")

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

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

Solution (Python):
a, = [list(map(int, s.split())) for s in open(0)][0]
tf = False
for i in range(1,10):
    for j in range(1,10):
        if i*j == a:
            tf = True
            break
    if tf:
        break

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

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

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

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

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

if a:
    print("No")

Solution (Python):
import sys

N = int(input())

for A in range(10):
    for B in range(10):
        if A * B == N:
            print('Yes')
            sys.exit()
print('No')

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

flag = False
for i in range(1, 10):
    if N%i == 0 and 1 <= N/i <= 9:
        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())
flg = False
for i in range(9,0,-1):
    if N % i == 0 and N//i <= 9:
        flg =True
        break
if flg:
    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())
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):
import sys
n=int(input())
for i in range(1,10):
    if(n%i == 0 and n//i < 10):
        print("Yes")
        sys.exit()
print("No")

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

results = []

for i in range(10):
    for j in range(10):
        results.append(i*j)

if n in results:
    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)
print('Yes' if n in a else 'No')

Solution (Python):
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:
    print("Yes")
else:
    print("No")

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

Solution (Python):
def solve():
  N = int(input())
  S = set()
  for i in range(1, 10):
    for j in range(1, 10):
      S.add(i * j)

  return 'Yes' if N in S else 'No'

print(solve())

Solution (Python):
import sys
input = sys.stdin.readline
from operator import itemgetter
sys.setrecursionlimit(10000000)

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

if __name__ == '__main__':
    main()

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

myset = set()

for i in range(1, 10):
    for j in range(1, 10):
        myset.add(i*j)

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

Solution (Python):
N = int(input())
for i in range(1, 10):
    if N % i == 0 and N // i in [1, 2, 3, 4, 5, 6, 7, 8, 9]:
        ans = 'Yes'
        break
else:
    ans = 'No'
print(ans)

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):
import sys

sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return list(map(int, sys.stdin.readline().split()))
def II(): return int(sys.stdin.readline())
def LS(): return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]

def main():
    n = II()
    ans = set()
    for i in range(1, 10):
        for j in range(1, 10):
            ans.add(i*j)
    if n in ans:
        print("Yes")
    else:
        print("No")

if __name__ == '__main__':
    main()

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

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

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

outStr = "No"
for i in range(9,0,-1) :
    for k in range(9,0,-1) :
        if (i*k == N) :
            outStr = "Yes"

print(outStr)

Solution (Python):
import collections
import numpy as np







N = int(input())

ans = 'No'
for i in range(9):
  for j in range(9):
    if (i + 1) * (j + 1) == N:
      ans = 'Yes'

print(ans)

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

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

Solution (Python):
N = int(input())
judge = 0
for i in range(9):
  for j in range(9):
    a,b = i+1,j+1
    if(N == a*b): judge = 1
if(judge == 0): print('No')
else: print('Yes')

Solution (Python):
if __name__ == '__main__':
    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())
l = []
for i in range(9):
    for j in range(9):
        l.append((i+1)*(j+1))
l = set(l)
if N in l:
    print("Yes")
else:
    print("No")

Solution (Python):


def readInts():
  return [int(s) for s in input().split(" ")]

def solve(N):
  for i in range(1, 10):
    if N % i == 0 and N // i <= 9:
      return 'Yes'
  return 'No'

def main():
  N = readInts()[0]
  print(solve(N))

if __name__ == "__main__":
  main()

Solution (Python):
import sys
sys.setrecursionlimit(1000000)
from math import factorial, ceil, floor
from bisect import bisect_right as bsr
from operator import itemgetter as ig
from collections import defaultdict as dd
from collections import deque, Counter as cnt


args = None
INF = float("inf")
MOD = int(1e9 + 7)
def input(*ps):
    if type(ps[0]) is list:
        return [input(*ps[0][:-1]) for _ in range(ps[0][-1])]
    elif len(ps) == 1:
        return ps[0](next(args))
    else:
        return [p(next(args)) for p in ps]
def nlist(n, v):
    if not n: return [] if type(v) is list else v
    return [nlist(n[1:], v) for _ in range(n[0])]


def main():
    N = input(int)
    for a in range(1, 10):
        for b in range(1, 10):
            if a * b == N:
                print("Yes")
                exit()
    else:
        print("No")

    return

if __name__ == '__main__':
    args = iter(sys.stdin.read().split())
    main()

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

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

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

if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())
State = "No"
for A in range(10):
    for B in range(10):
        if A*B==N:
            State = "Yes"
print(State)

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

Solution (Python):
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")

Solution (Python):
n=int(input())
c=0
ans='No'
for i in range(1,10):
  if n%i==0:
    c=int(n/i)
    if c>9:
      continue
    else:
      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')
            break
    else:
        continue
    break
else:
    print('No')

Solution (Python):

import sys

YES = "Yes"  
NO = "No"  


def solve(N: int):
    for i in range(1,10):
        for j in range(i,10):
            if N == i*j:
                print(YES)
                return
    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())
ch = 0
for i in range(1, 10):
    for j in range(1, 10):
        if i * j == n:
            ch = 1
            break
if ch: print("Yes")
else: print("No")

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

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

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

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

Solution (Python):






def main():

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






if __name__ == "__main__":
    main()

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

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


if __name__ == '__main__': main()

Solution (Python):


from sys import stdin, stderr

def main():
   N = int(stdin.readline())
   L = [ a*b for a in xrange(1, 10) for b in xrange(1, 10) ]

   print('Yes' if N in L else 'No')

   return 0

if __name__ == '__main__': main()

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

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

check = False
for i in range(1, 10):
    if N%i == 0:
        if N//i < 10:
            check = True
            break

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

Solution (Python):
hoge = []

for i in range(1, 10):
    for j in range(1, 10):
        hoge.append(i*j)

N = int(input())
if N in hoge:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys
sys.setrecursionlimit(10000000)


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

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())
chk=False
for i in range(1,10):
  if n%i==0 and n//i<=9:
    chk=True
print("Yes" if chk else "No")

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):
import sys
import math
input = sys.stdin.readline




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):
    if N % i == 0:
        if N // i <= 9:
            print("Yes")
            exit()
print("No")

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

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

Solution (Python):
N = int(input())
frag = False
for a in range(10):
    for b in range(10):
        if a * b == N:
            frag = True

if frag == True:
    print("Yes")
else:
    print("No")

Solution (Python):






import math
import statistics
import numpy as np
import queue

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

Solution (Python):

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

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

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

Solution (Python):
n = int(input())
key = 0
for i in range(1, 10):
    for j in range(1, 10):
        if n/(i*j) == 1 and n%(i*j) == 0:
            key = 1
            break
    if key == 1:
        break

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

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

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

Solution (Python):
import sys

N = int(input())

for i in range(1, 10):
	if N % i == 0 and N // i <= 9:
		print("Yes")
		sys.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(0)
print("No")

Solution (Python):
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)

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())

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

print(ans)

Solution (Python):
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')

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

Solution (Python):
s = set()
for i in xrange(1, 10):
  for j in xrange(1, 10):
    s.add(i * j)
print 'Yes' if int(raw_input()) in s else '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 = list(map(int, input().split(" ")))[0]

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

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

Solution (Python):
def read_values():
    return map(int, input().split())


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


def f():
    N = int(input())

    for a in range(9, 0, -1):
        if N % a != 0:
            continue
        b = N // a
        if 1 <= b <= 9:
            print("Yes")
            return

    print("No")


if __name__ == '__main__':
    f()