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 main():
    N = int(input())
    for i in range(10):
        for j in range(10):
            if N == (i*j):
                print("Yes")
                return 0
    print("No")
    return 0
if __name__ == '__main__':
    main()

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

for i in range(1, 10):
    if N % i == 0 and N // i < 10:
        print('Yes')
        flag = True
        break

if not flag:
    print('No')

Solution (Python):
a = int(input())
li = []

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

if a in li:
  print('Yes')
else:
  print('No')

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

flag = False
for num in range(1, 10):
  q, mod = divmod(input, num)
  if(q <= 9 and mod == 0):
    flag = True
    break
    
if(flag):
  print('Yes')
else:
  print('No')

Solution (Python):

N = int(input())
A = 100000000000

for i in range(1,10):
    if N % i == 0:
        B = N//i
        A = min(A, B)
    
    
if A <= 9:
    print('Yes')

else:
    print('No')

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

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

Solution (Python):
"""
author : halo2halo
date : 9, Jan, 2020
"""

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

N = int(readline())








se = set(x * y for x in range(1, 10) for y in range(1, 10))

ans = 'Yes' if N in se else 'No'
print(ans)

Solution (Python):
"""
author : halo2halo
date : 9, Jan, 2020
"""

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

N = int(readline())

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


ans = 'Yes' if flag else 'No'
print(ans)

Solution (Python):
X = int(input())
A = [1,2,3,4,5,6,7,8,9]
B = [1,2,3,4,5,6,7,8,9]
C =[]

for i in A:
    for j in B:
        k=i*j
        C.append(k)

C= list(set(C))

if X in C:
    print("Yes")
else:
    print("No")

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

if __name__ == "__main__":
    main()

Solution (Python):
import sys
def input():
    return sys.stdin.readline()

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

if __name__ == '__main__':
    main()

Solution (Python):
import sys


def solve(inp):
    N = int(inp.readline().strip())

    for a in range(1, 10):
        for b in range(1, 10):
            if a * b == N:
                return "Yes"
    return "No"


def main():
    result = solve(sys.stdin)
    if result:
        print(result)


if __name__ == '__main__':
    main()

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

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

Solution (Python):
n = int(input())
k = 0
for i in range(1, 10):
  for j in range(i, 10):
    seki = i * j
    if n == seki:
      k += 46
    else:
      k += -1
if k < 0:
  print("No")
else:
  print("Yes")

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

ans = "No"
for i in range(9):
	if (N % (i+1) == 0) & ( N / (i+1) <= 9):
		ans = "Yes"
		break
print(ans)

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

kuku = []


for i in range(1,10,1):
  for j in range(1,10,1):
    kuku.append(i*j)
    
if N in kuku:
  print("Yes")
else:
  print("No")

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

n_list = []
for x in range(1,10):
    for y in range(1,10):
        n_list += [x*y]

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

Solution (Python):

import copy
import random
import bisect 
import fractions 
import math
import sys
import bisect

mod = 10**9+7
sys.setrecursionlimit(mod) 

def LI(): return list(map(int, sys.stdin.readline().split()))

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

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

Solution (Python):
x=int(input())
for i in range(1,10):
    if(x%i==0 and x/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 i*j == N:
            print('Yes')
            break
    else:
        continue
    break
else:
    print('No')

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

result = 'No'

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

print(result)

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

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

if not(flag):
    print("No")

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
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 I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)


def main():
    n = I()
    for i in range(1,10):
        if n % i == 0 and n // i < 10:
            return "Yes"

    return "No"


print(main())

Solution (Python):
l=[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 24, 25, 27, 28, 30, 32, 35, 36, 40, 42, 45, 48, 49, 54, 56, 63, 64, 72, 81]
print('Yes' if int(input()) in l else 'No')

Solution (Python):
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())
for i in range(1,10):
    for j in range(1,10):
        ij = i * j
        if(N == i*j):
            print("Yes")
            exit(0)
print("No")

Solution (Python):



N = int(input())

flag = 0
for i in range(1, 10, 1) : 
    for j in range(1, 10, 1) : 
        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 and N//i<10:
        print("Yes")
        exit(0)
print("No")

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

Solution (Python):
N = int(input())
I = 0
J = 0
for i in range(9):
  for j in range(9):
    if (i + 1) * (j + 1) == N:
      I = i + 1
      J = j + 1
      break

print("Yes" if I*J >= 1 else "No")

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

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

Solution (Python):
import sys
n = int(input())
for x in range(1,10):
 for y in range(1,10):
  if x*y == n:
   print("Yes")
   sys.exit()

print("No")

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

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

print("No")

Solution (Python):



def main():
    n = int(input())
    count = 0
    
    for i in range(1, 10):
        syo, amari = divmod(n, i)
        if syo <= 9 and amari == 0:
            print('Yes')
            break
            
        else:
            count += 1
            
    if count == 9:
        print('No')
    
    return 0
    
    
if __name__ == '__main__':
    main()

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


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


if is_OK(N):
    print('Yes')
else:
    print('No')

Solution (Python):
n = int(input())
for i in range(1,10):
    for j in range(i,10):
        if n == i*j:
            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(0)

print("No")

Solution (Python):



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

    for i in range(1, 10):
        div, mod = divmod(n, i)
        if 1 <= div <= 9 and mod == 0:
            print('Yes')
            return 0
    print('No')
    
    return 0
    
    
if __name__ == '__main__':
    main()

Solution (Python):
from functools import reduce

def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a

n = int(input())
factor = [1] + prime_factorize(n)

if len(factor) < 2:
    print('Yes')
else:
    for i in range(1,len(factor)):
        a = reduce(lambda x,y:x*y, factor[:i])
        b = reduce(lambda x,y:x*y, factor[i:])
        if 1 <= a <= 9 and 1 <= b <= 9:
            print('Yes')
            break
    else:
        print('No')

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


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")
            break
    else:
        continue
    break
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())
mylist = []

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

mylist = set(mylist)

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

Solution (Python):



from itertools import combinations


N = int(input())


l = list(range(1,10))
if N in [i*j for i, j in combinations(l+l, 2)]:
    print('Yes')
else:
    print('No')

Solution (Python):
def ints():
  return [int(x) for x in input().split()]
def ii():
  return int(input())

memo = {}

for i in range(1, 10):
  for j in range(i, 10):
    memo[i*j] = True

n = ii()
if n in memo:
  print('Yes')
else:
  print('No')

Solution (Python):
N = int(input())
for a in range(1, 10):
	if N % a == 0 and N // a < 10:
		print('Yes')
		exit(0)
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())
res = "No"
for i in range(1, 10):
    for j in range(1, 10):
        if i*j == n:
            res = "Yes"
print(res)

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):
def main():
  N = int(input())

  for i in range(1, 10):
    if N%i == 0:
      if N//i < 10:
        print("Yes")
        return 0
  else:
    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 i * j == n:
            flag = True
            break
    if flag:
        break

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

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

Solution (Python):
from itertools import product as prod
avail_numbers = [(i + 1) * (j + 1) for i, j in prod(range(9), range(9))]

if int(input()) in avail_numbers:
  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"
            print(ans)
            break
    if ans=="Yes":
        break
if ans=="No":
    print(ans)

Solution (Python):
import itertools

T = [1,2,3,4,5,6,7,8,9]
L = list(itertools.product(T, repeat=2))
S = []
for i in range(len(L)):
    S.append(L[i][0]*L[i][1])
    
n = int(input())
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()
print("No")

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

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):
A = int(input())

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

ans = "No"

if A in kk:
    ans = "Yes"

print(ans)

Solution (Python):
import itertools


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

    return N,


def solve(N, ):
    for i in range(9):
        a = i + 1
        for j in range(9):
            b = j + 1
            if a*b==N:
                return "Yes"
            else:
                continue
    return "No"


            
            
            
            
            
            
            
            
            
            
            


if __name__ == '__main__':
    input = read()
    print(solve(*input))

Solution (Python):
N = int(input())
ans = False
for i in range(1, 10):
    d = N // i
    if d <= 9 and N == i * d:
        ans = True

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

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

Solution (Python):


b = int(input())
a = []
for i in range(9):
    for j in range(9):
        a.append((i+1)*(j+1))

if b in set(a):
    print('Yes')
else:
    print('No')

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

multi = []

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

if N in multi:
    print("Yes")

else:
    print("No")

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

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

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

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

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

a = list(itertools.product(range(1, 10), repeat=2))
b = list(map(lambda x: x[0] * x[1], a))

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

Solution (Python):
import sys
from collections import defaultdict, deque
import bisect
from heapq import *
sys.setrecursionlimit(200000)
input = sys.stdin.readline

N, = map(int, input().split())








for i in range(1, 10):
    for j in range(1, 10):
        if i * j == N:
            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 <10:
            print("Yes")
            return 

    print("No")
    
solve()

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

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

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

Solution (Python):
N = int(input())
A = list(range(1, 10))
B = [a for a in A if N % a == 0]
C = [b for b in B if N / b < 10]
if len(C) != 0:
  print('Yes')
else:
  print('No')

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

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

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

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

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

flag = True

for i in range(1,10):
    for j in range(1,10):
        
        if i * j == N:
            print("Yes")
            flag = False
    if not(flag):
        break

if flag:
    print("No")

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


if __name__ == '__main__':
	main()

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
        else:
            pass
    
print(ans)

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

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

Solution (Python):

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

YES = "Yes"  
NO = "No"  

def solve(N: int):
    for i in range(1,10):
        for j in range(1,10):
            if i*j == N:
                print(YES)
                exit()

    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())
out=["No","Yes"]
flg=0

for i in range(1,10):
    if N%i==0 and N//i<=9:
        flg=1
        break

print(out[flg])

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

l1 = []
for i in range(9):
  for j in range(9):
    l1.append((i +1) * (j + 1))

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

Solution (Python):
n = int(input())
c = 0
for i in range(9):
  q, mod = divmod(n, i + 1)
  if q < 10 and mod == 0:
    print("Yes")
    c += 1
    break
if c == 0:
  print("No")

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

Solution (Python):
num = int(input())
key = 0
for i in range(9):
    for l in range(9 - i):
        if(num == (i + 1) * (l + i + 1)):
            key = 1
            break
if(key == 1):
    print('Yes')
else:
    print('No')

Solution (Python):
N = input()
N = int(N)
xs = []
xs.append(1)
xs.append(2)
xs.append(3)
xs.append(4)
xs.append(5)
xs.append(6)
xs.append(7)
xs.append(8)
xs.append(9)

for i in range(len(xs)):
  if N % xs[i] == 0:
    a = N // xs[i]
    if a >= 1 and a <= 9:
      result = "Yes"
      break
    else:
      result = "No"
  else:
    result = "No"

print(result)

Solution (Python):
N=int(input())
 
if N>81:
  print('No')
else:
  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())
list=[]
for i in range(1,10):
  for j in range(1,10):
    list.append(i*j)
if N in list:
   print("Yes")
else:
   print("No")

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

for s in range(1,10):
    for t in range(1,10):
        if n == s*t:
            ans += 1
    
if ans == 0:
  print('No')
else:
  print('Yes')

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

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

print(in_kuku(n))

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

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

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

Solution (Python):
import sys


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    d = {i * j for i in range(1, 10) for j in range(1, 10)}
    n = int(input().rstrip('\n'))
    print("Yes" if n in d else "No")


if __name__ == '__main__':
    solve()

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

for a in range(1, 10):
    for b in range(1, 10):
        if a * b == N:
            print("Yes")
            sys.exit(0)

print("No")

Solution (Python):
import numpy as np

N = int(input())
arr = np.arange(1, 10)
arr2 = arr[:, np.newaxis] * arr

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

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

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

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

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

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

Solution (Python):
x = int(input())
for i in range(1,10):
    for j in range(1,10):
        if x == i * j:
            print ('Yes')
            exit(0)
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())

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

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

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

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

c = 0

for i in range(1,10):
    for j in range(1,10):
        if i*j == n:
            c += 1

if c != 0:
    print('Yes')

else:
    print('No')

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())
alist=[]
for i in range(1,10):
  for k in range(1,10):
    alist.append(i*k)
if N in alist:
  print("Yes")
else:
  print("No")

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

N = int(input())

print("Yes" if N in multiplication_table else "No")

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

flg = False
for i in range(1,10):
  for j in range(1,10):
    if N == i * j:
      flg = True
      break
      
print('Yes' if flg else '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):
n = int(input())

for i in range(9):

     if n%(i+1) == 0 and n//(i+1) < 10:
         print('Yes')
         break

else:
    print('No')

Solution (Python):
cucu = []
for i in range(1,10):
    for j in range(1,10):
        cucu.append(i*j)
if int(input()) in cucu:
    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
    if i == 9:
        print("No")

Solution (Python):
import math
if __name__=='__main__':
    flag=0
    n=int(input())
    for i in range((int(math.sqrt(n)))):
        if n%(i+1)==0:
            if len(str(i+1))==1 and len(str(n//(i+1)))==1:
                flag=1
                break
    if flag==1:
        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 valid(n):
    for i in range(1, 10):
        for j in range(1, 10):
            if i*j == n:
                return "Yes"
    return "No"

print(valid(n))

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())
A = [1,2,3,4,5,6,7,8,9]
for i in A:
  if N%i==0 and int(N/i) in A:
    print('Yes')
    exit()
print('No')

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

for i in range(9):
    if N % (i+1) == 0:
        a = N /(i+1)
        if len(str(int(a))) == 1:
                print("Yes")
                break
    elif (i) == 8:
        print("No")

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)

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

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

for i in range(1, 10):
    d, m = divmod(N, i)

    if d > 9:
        continue

    if not m:
        print('Yes')
        break
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(0)
print("No")

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

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

YesFlg=0
NoFlag=0
for i in range(1,10):
    a,b=divmod(num, i)
    
    if b==0 and a<10:
        YesFlg=1
   

if YesFlg!=1:
    print("No")
else:
    print("Yes")

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

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

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

for i in range(1, 10):
  if n % i ==0:
    if n/i < 10:
      print('Yes')
      break
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())

flag = False

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


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

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'
            break;
print(ans)

Solution (Python):
N = int(input())
list9 = []
for i in range(1,10):
    for j in range(i, 10):
        list9.append(i*j)
try:
    list9.index(N)
    print('Yes')
except ValueError:
    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"
print(ans)

Solution (Python):
N = int(input())
rlst = 'No'
for i in range(1, 10):
    if N%i==0:
        min_ = int(N/i)
        if min_ > 9:
            continue
        for j in range(min_, 10):
            if min_%j == 0:
                rlst = 'Yes'
                break;
print(rlst)

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

for i in range(1, 10):
    for j in range(1, 10):
        if i * j == N:
            c = 1

if c == 1:
    print('Yes')
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())
result = "No"
for i in range(1,10):
    if n % i == 0 and n // i <= 9:
        result = "Yes"
        break
print(result)

Solution (Python):
N = int(input())
for m in range(1,10):
    for n in range(1,10):
        if N == m*n:
            print("Yes")
            break
    else:
        continue
    break
else:
    print("No")

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

list = [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 list.count(n) > 0:
  print('Yes')
else:
  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):
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")

Solution (Python):
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
    n=int(input())
    for a in range(1,10):
        q,r=divmod(n,a)
        if(r==0 and 1<=q<=9):
            print("Yes")
            return
    print("No")
resolve()