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())]
kuku=[]
for i in range(1,10):
    for j in range(1,10):
        kuku.append(i*j)
if set(n)<=set(kuku):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())
ans=0
for i in range(1,10):
    for j in range(1,10):
        if i*j==N:
            ans+=1
        else:
            pass
if ans>=1:
    print('Yes')
else:
    print('No')

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

ans=0
for i in range(1,10):
    for j in range(1,10):
        if i*j==a:
            ans+=1

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

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

for i in range(1, 10):
    if n / i < 10 and n % i == 0:
        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())
count=0
for i in range(1,10):
  for j in range(1,10):
    if i*j==n:
      count=1
print(["No","Yes"][count==1])

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

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

print(res)

Solution (Python):
if __name__ == '__main__':
    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())

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

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

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

Solution (Python):


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



main()

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

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

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

for n in range(1, 10):
    for k in range(1, 10):
        a = n * k
        if a == x:
            print('Yes')
            exit()
        else:
            pass
print('No')

Solution (Python):
x = int(input())
count =0

for n in range(1, 10):
    for k in range(1, 10):
        a = n * k
        if a == x:
            print('Yes')
            exit()
        else:
            pass
print('No')

Solution (Python):
x = int(input())
count =0

for n in range(1, 10):
    for k in range(1, 10):
        a = n * k
        if a == x:
            count += 1
            break
        else:
            pass
if count > 0:
    print('Yes')
else:
    print('No')

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

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

output = 'No'
for i in range(1,10):
    for j in range(1,10):
        if (i*j == x):
            output = 'Yes'

print(output)

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(9):
    for j in range(9):
        if (i + 1) * (j + 1) == N:
            print("Yes")
            exit(0)

print("No")

Solution (Python):
def main():
    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
        else:
            continue
        break
    if not flag:
        print("No")


if __name__ == "__main__":
    main()

Solution (Python):
n = int(input())
li = [1,2,3,4,5,6,7,8,9]
for i in range(9):
    for j in range(9):
        if li[i] * li [j] == n:
            print("Yes")
            exit()
        else:
            pass
print("No")

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

    print("No")


main()

Solution (Python):
from sys import exit
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
if flag>=1:
	print('Yes')
else:
	print('No')

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

flag = False

for i in range(1, 10):
    for j in range(1, 10):
        ij = i*j
        if n == ij:
            flag = True
            break
    if flag:
        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 N == i * j: 
      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'
      break
print(ans)

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

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

for i in range(9, 0, -1):
    if n % i == 0:
        n //= i
        break
for i in range(9, 0, -1):
    if n / i == 1:
        print('Yes')
        sys.exit(0)
        break
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)==1:
      Ans="Yes"
print(Ans)

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")
    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")
    quit()
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):
a = int(input())
c = 0
s = 1
while s < 10:
  t = 1
  while t < 10:
    if s*t == a:
      c += 1
    t += 1
  s += 1
if c ==0:
  print('No')
else:
  print('Yes')

Solution (Python):
ANS = []

for i in range(1,10):
    for j in range(1,10):
        ANS.append(i*j)
        
n = int(input())

print(["No","Yes"][n in ANS])

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"
        else:
            pass

print(ans)

Solution (Python):
n = int(input())
i = 1
j = 1
ans = "No"

for i in range(10):
    for j in range(10):
        if i*j == n:
            ans = "Yes"
        else:
            pass

print(ans)

Solution (Python):
import sys
n = int(sys.stdin.readline())
li = []
i = 1
while i <= 9:
  k = 1
  while k <= i:
    li.append(i*k)
    k += 1
  i += 1
if n in li:
  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 N in a:
    print('Yes')
else:
    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):
N = int(input())

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

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

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

Solution (Python):
n = int(input())
lists = list()
for i in range(1,10):
  for j in range(1,10):
    if i * j == n:
      lists.append(1)
    else:
      lists.append(0)

if not max(lists) == 1:
  print('No')
else:
  print('Yes')

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

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

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

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 a in range(1,10):
    for b in range(1,10):
        if n==a*b:
            print('Yes')
            exit()
print('No')

Solution (Python):
def make_divisor(n):
  divisors=[]
  for i in range(1,int(n**0.5)+1):
    if n%i==0:
      divisors.append([n//i,i])
  return divisors

n = int(input())
lis = make_divisor(n)
for j in lis:
  if j[0]<10 and j[1]<10:
    print('Yes')
    exit(0)
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())
s = set([])
for i in range(1, 10):
    for j in range(i, 10):
        s |= {i * j}
print('Yes' if n in s else 'No')

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

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

Solution (Python):
n = int(input())
f = False
for i in range(1, 10):
    for j in range(1, 10):
        if n == i*j:
            f = True
            break

if f:
    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):
import os

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

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

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

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

Solution (Python):
import sys
from math import ceil, floor, sqrt, sin, cos, pi
from itertools import accumulate, permutations, combinations
from fractions import gcd 
from collections import deque, Counter
from operator import itemgetter
from heapq import heappop,heappush
sys.setrecursionlimit(10**7)
def lcm(x, y): return ((x * y) // gcd(x, y)) 


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

print("No")

Solution (Python):
import math
from functools import reduce
import itertools
import numpy as np

def solve():
    n = int(input())
    num = list(range(1,10))
    bit = 0
    for i in num:
        for j in num:
            if i * j == n:
                print("Yes")
                bit = 1
                break
        if bit == 1:
            break
    if bit == 0:
        print("No")
    return 0

if __name__ == "__main__":
    solve()

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):
n = int(input())
ans="No"
for i in range(10):
    for j in range(10):
        if i*j == n:
            ans = "Yes"
            break

print(ans)

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

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

Solution (Python):
N = int(input())
kuku = [x * y for x in range(1,10) for y in range(1, 10)]
if N in kuku:
    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())

kuku = [0] * 81

k = 0
for i in range(1,10):
  for j in range(1,10):
    k = k + 1
    kuku[k-1] = i * j
    if (i*j == N):
      print("Yes")
      exit()
    else:
      pass

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):
  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())
flg = 0
for i in range(1,10):
  for j in range(1,10):
    if i * j == n:
      flg = 1
      break
if flg == 1:
  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):
l = []
x = []
temp = []
for i in range(1,10):
    l.append(i)
    x.append(i)
for j in l:
    for z in x:
        temp.append(j*z)
n = int(input())
if n in temp:
    print("Yes")
else:
    print("No")

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

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

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

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

flag = 0

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

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

Solution (Python):

N = int(input())

canExpress = 'No'

for i in [1, 2, 3, 4, 5, 6, 7, 8, 9]:
    if N % i == 0 and N // i < 10:
        canExpress = 'Yes'
        break

print(canExpress)

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

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

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

ans = "No"
for a in range(9, 0, -1):
    b, mod = divmod(n, a)
    if mod == 0:
        if b <= 9:
            ans = "Yes"
        break
print(ans)

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

Solution (Python):
N = int(input())
k = False
for a in range(1, 10):
    for b in range(1, 10):
        if a * b == N:
            k = True
            break
if k:
    print("Yes")
else:
    print("No")

Solution (Python):
N=int(input())
OK = False
for i in range(9):
  for k in range(9):
    if N==(i+1)*(k+1):
      OK = True
      break
if OK:
  print('Yes')
else:
  print('No')

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

v = [0]*81

for i in range (1, 10):
	for j in range (1, 10):
		v[(i-1)+9*(j-1)]=i*j

if v.count(N) > 0:
	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(0)
print('No')

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

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

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

if cnt >= 1:
    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:
      if i*j==N:
        print("Yes")
        sys.exit()
print("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())
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())

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(1,N+1):
    if  N%i ==0:
        if i<=9 and N/i <=9:
            flg = True
            break
            
if flg == True:
    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):
from itertools import product
n = int(input())
for i, j in product(range(1, 10), repeat=2):
    if n == i * j:
        print('Yes')
        break
else:
    print('No')

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

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

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

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

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):
N = int(input())
def divisor_all(n): 
    l = [1,n]
    for i in range(2,int(pow(n,1/2))+1):
        if n % i == 0:
            if i == n//i:
                l.append(i)
            else:
                l.append(i)
                l.append(n//i)
    l.sort()
    return l 
L = divisor_all(N)
flag = False
for i in range(len(L)):
    if 1<=L[i]<=9 and 1<=N//L[i]<=9:
        flag = True
        break
if flag:
    print('Yes')
else:
    print('No')

Solution (Python):
x = input()
x = int(x)
answer = ''

for i in range(9):
    i = i + 1
    if x % i == 0:
        shou = x // i
        if (1 <= i and i <= 9) and (1 <= shou and shou <= 9):
            answer = 'Yes'
            break
        else:
            answer = 'No'
    else:
        answer = 'No'
print(answer)

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
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):
N = int(input())
list = list(range(1,10))
ans = 0
for i in list:
    for k in list:
        if i*k == N:
            ans = 1
print('Yes' if ans == 1 else 'No')

Solution (Python):
import math
import fractions
import sys
import itertools
import numpy as np
from collections import Counter

def input1():
	return int(input())


def input2():
	return map(int,input().split())


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

def keta(N):
	return len(str(N))



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

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

flag = False
for _ in range(1,10):
  sho = n // _
  amari = n % _
  if sho <= 9 and amari == 0:
    flag = True
if flag:
  print('Yes')
else:
  print('No')

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')
MOD = 10**9+7


def main():
  N = int(input())
  ans = 'No'
  for i in range(1,10):
    n = N/i
    for j in range(1,10):
      if n == j:
        ans = 'Yes'
  
  print(ans)
  
  
if __name__ == '__main__':
  main()

Solution (Python):
def I(): return int(input())
N = I()
ans = 0
for i in range(1,10):
    for j in range(1,10):
        if N==i*j:
            ans = 1
            break
print({0:'No',1:'Yes'}[ans])

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

Solution (Python):
x=int(input())
c=0
for i in range(1,10):
    for j in range(1,10):
        
        if (j*i==x):
            c=c+1
if (c==0):
    print('No')
if (c!=0):
    print('Yes')

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

Solution (Python):
def b81_re(N):
    if N>81:
        return 'No'
    for i in reversed(range(1,10)):
        if N%i == 0:
            if N/i<=9:
                return 'Yes'
    return 'No'


if __name__ == "__main__":
    N = int(input())
    print(b81_re(N))

Solution (Python):
def b81(N):
    for i in range(1,10):
        for j in range(1,10):
            if i*j == N:
                return "Yes"
    return "No"


if __name__ == "__main__":
    N = int(input())
    print(b81(N))

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

print(ans)

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

Solution (Python):



N = int(input())

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

Solution (Python):
n=int(input())
s=[[0]*9]*9
x=0
for i in range(1,10):
  for j in range(1,10):
    if i*j==n and x==0:
      x+=1
      print("Yes")
      
if x==0:
  print("No")

Solution (Python):


n = int(input())

if any([n % i == 0 and n // i < 10 for i in range(1, 10)]):
    print("Yes")
else:
    print("No")

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

K=[i*j for i in range(10) for j in range(10)]

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

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

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

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

Solution (Python):
N = int(input())
ans = 'No'
for a in range(10):
    for b in range(10):
        if a*b == N:
            ans = 'Yes'

print(ans)

Solution (Python):

import sys
import numpy as np

YES = "Yes"  
NO = "No"  


def solve(N: int):
    a = []
    for i in range(1,10):
        for j in range(1,10):
            a.append(i*j)
    b = list(set(a))
    if N in b:
        print(YES)
    else:
        print(NO)



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

if __name__ == "__main__":
    main()

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

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

x = 0
for i  in range(9):
    data = c / (i+1)
    if 1 <= data <=9:
        if int(data) * (i +1) == c: 
            print("Yes")
            x = 1
            break

if x == 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())
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())
prime = [2]
for i in range(3, 101):
  for j in range(2, i + 1):
    if (i % j) == 0:
      break
  if i == j:
    prime.append(i)
pflag = True
for k in prime:
  if k >= 10:
    if (n % k == 0):
      pflag = False
for l in range(50, 101, 10):
  if (n % l) == 0:
    pflag = False
if n > 81:
  pflag = False
if(pflag):
  print('Yes')
else:
  print('No')

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

ans=False
for a in range(1,10):
    for b in range(1,10):
        if a*b==N:
            ans=True
        else:
            pass

if ans==True:
    print('Yes')
else:
    print("No")

Solution (Python):
def check(n):
    for i in range(1,10):
        div, mod = divmod(n, i)
        if (div<10) and (mod==0): return 'Yes'
    return 'No'

n = int(input())
print(check(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())
flag = True
for i in range(10):
    for j in range(10):
        kuku = i * j
        if n == kuku:
            print("Yes")
            flag = False
            break
    else:
        continue  
    break  

if flag:
    print("No")

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

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

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

for i in range(1,10):
    for j in range(1,10):
        m = i*j
        if m == n:
            count = 1

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

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

for i in range(1,10):
    for j in range(1,10):
        m = i*j
        if m == n:
            count = 1

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

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

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

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

for i in range(1,10):
    for j in range(1,10):
        m = i*j
        if m == n:
            count = 1


if count == 0:
    print("No")
else:
    print("Yes")

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

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

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

print(judge(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):
def q2():
    N = int(input())
    ans = 'No'
    for i in range(1,10):
        d,m = divmod(N,i)
        if m == 0 and d < 10:
            ans = 'Yes'
    print(ans)


if __name__ == '__main__':
    q2()

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