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

Solution (Python):

N = int(input())

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

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

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

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

list99 = set()

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

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

Solution (Python):
import itertools

n = int(input())
arr = itertools.combinations_with_replacement(range(1, 10), 2)
ans = [True for a, b in arr if a * b is n]

print(["No", "Yes"][len(ans) > 0])

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

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):
if __name__ == '__main__':
    r = range(1,10)
    tables = [i * j for i in r for j in r]
    i = int(input())
    print('Yes' if i in tables else 'No')

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

Solution (Python):
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):
number = int(input())
ans = 0
for i in range(1,10):
  if number%int(i) == 0:
    if number/int(i) <= 9:
      ans += 1
    else:
      pass
  else:
    pass
if ans > 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()
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())

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

print('No')

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

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

Solution (Python):
N = int(input())
ans = "No"
if N <=81:
  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())

flag = False

for onerank in range(10):
    for tworank in range(10):
        if onerank * tworank == N:
            flag = True
            break
if flag == True:
    print("Yes")
else:
    print("No")

Solution (Python):
r=range(10)
print(['No','Yes'][int(input()) in {i*j for i in r for j in r}])

Solution (Python):
N = int(input())
output = "No"
x = [i+1 for i in range(9)]

for i in x:
  num = N / i
  num_int = N // i
  if num == num_int and num < 10:
    output = "Yes"
print(output)

Solution (Python):
N = int(input())
output = "No"
x = [(i+1)*(j+1) for i in range(9) for j in range(9)]

if N in x:
    output = "Yes"
print(output)

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

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

k = []

for i in range(1, 10):
    for j in range(1, 10):
        if i <= j:
            k.append(i * j)

if n in k:
    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(0)
      
print("No")

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

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

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

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

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

l = [num for num in range(1,10)]

kuku=[]
for h in [[x*y for y in l] for x in l]:
    kuku.extend(h)

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

Solution (Python):
import sys
import math


a=int(input())
i=j=1
for i in range(10):
  for j in range(10):
    if a==i*j:
      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')
      break
  else:
    continue
  break
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')
      break
  else:
    continue
  break
else:
  print('No')

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

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

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

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

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

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

Solution (Python):
from sys import stdin
import itertools

n = int(stdin.readline().rstrip())

nums = [int(x) for x in range(1, 10)]

kuku = itertools.combinations_with_replacement(nums, 2)

ans = "No"

for i in list(kuku):
    if i[0] * i[1] == n:
        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(0)
print('No')

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

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

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):
kuku = [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]
if int(input()) in kuku:
    print('Yes')
else:
    print('No')

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

Solution (Python):
import sys
import os


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    N = int(sys.stdin.readline().rstrip())
    ret = 'No'
    for i in range(10):
        if i == 0:
            continue

        q, mod = divmod(N, i)
        if q < 10 and mod == 0:
            ret = 'Yes'
            
    print(ret)

if __name__ == '__main__':
    main()

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

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

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

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

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

Solution (Python):





import sys

ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)

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

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

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

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

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

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

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

Solution (Python):
import sys

product = int(input())
for a in range(1,10,1):
    for b in range(1,10,1):
        if a*b == product:
            print('Yes')
            sys.exit()

print('No')

Solution (Python):
import sys

import numpy as np
import math, string, itertools, fractions, heapq, collections, re, array, bisect, copy, functools, random
from collections import deque, defaultdict, Counter
from heapq import heappush, heappop
from itertools import permutations, combinations, product, accumulate, groupby
from bisect import bisect_left, bisect_right, insort_left, insort_right
from operator import itemgetter as ig
sys.setrecursionlimit(10 ** 7)
inf = 10 ** 20
INF = float("INF")
mod = 10 ** 9 + 7
"""dd = [(-1, 0), (0, 1), (1, 0), (0, -1)];
ddn = dd + [(-1, 1), (1, 1), (1, -1), (-1, -1)];
ddn9 = ddn + [(0, 0)]
for dx, dy in dd:
        nx = j + dx; ny = i + dy
            if 0 <= nx < w and 0 <= ny < h:"""

def wi(): return list(map(int, sys.stdin.readline().split()))
def wip(): return [int(x) - 1 for x in sys.stdin.readline().split()]  
def ws(): return sys.stdin.readline().split()
def si(): return int(sys.stdin.readline())  
def ss(): return input()
def hi(n): return [si() for _ in range(n)]
def hs(n): return [ss() for _ in range(n)]  
def s_list(): return list(input())
def mi(n): return [wi() for _ in range(n)]  
def mip(n): return [wip() for _ in range(n)]
def ms(n): return [ws() for _ in range(n)]
def num_grid(n): return [[int(i) for i in sys.stdin.readline().split()[0]] for _ in range(n)]  
def grid(n): return [s_list() for _ in range(n)]


def main():

    flag = False
    memo = []
    n = int(input())
    for i in range(1,10):

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

            memo.append(i*j)
            if n in memo:
                print("Yes")
                flag = True
                break




    if flag==False:
        print("No")


if __name__ == '__main__':
    main()

Solution (Python):
numbers = [1, 2, 3, 4, 5, 6, 7, 8, 9]
N = int(input())
for n in filter(lambda x: N % x == 0, numbers):
    if int(N / n) in numbers:
        print("Yes")
        exit()
print("No")

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

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

can = False
for n in range(1, 10):
  for m in range(1, 10):
    if (N == n * m):
      can = True

result = "Yes" if can else "No"
print(result)

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

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

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

print("No")

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

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

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

Solution (Python):
import math

N = int(input())
lis = list(range(1, 10))
start_idx = 0
found = False
for start_idx in range(len(lis)):
    if found:
        break
    idx = start_idx
    for idx in range(len(lis)):
        if lis[start_idx] * lis[idx] == N:
            found = True
if found:
    print('Yes')
else:
    print('No')

Solution (Python):
import math

N = int(input())
lis = list(range(1, 10))
start_idx = 0
found = False
while start_idx < len(lis):
    if found:
        break
    idx = start_idx
    for idx in range(len(lis)):
        if lis[start_idx] * lis[idx] == N:
            found = True
    start_idx += 1
if found:
    print('Yes')
else:
    print('No')

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

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

if n in multiplication_table:
    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"

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

Solution (Python):
import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
mod = 10 ** 9 + 7
inf = float('inf')
ninf = -float('inf')
 

def ii(): return int(sys.stdin.readline().rstrip()) 
def mii(): return map(int,sys.stdin.readline().rstrip().split())
def limii(): return list(mii()) 
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]

def ss(): return sys.stdin.readline().rstrip() 
def mss(): return sys.stdin.readline().rstrip().split()
def limss(): return list(mss()) 
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]





n=ii()
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())
boo=False
for i in range(1,10):
  for j in range(1,10):
    if i*j==N:
      boo=True
      break
if boo==True:
  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 n == i * j:
                print("Yes")
                return
    print("No")


if __name__ == "__main__":
    main()

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

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

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

Solution (Python):
list = []

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

N = int(input())

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

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

a = "No"

for i in range(1,10):
  if num%i == 0:
    num_0 = num//i
    if 0<num_0<10:
      a = "Yes"

print(a)

Solution (Python):
n = int(input())
a = list(range(1, 10))

no = True
for x in a:
    if n/x in a:
        print("Yes")
        no = False
        break

if no: print("No")

Solution (Python):
a=int(input())
def main():
    while True:
        for i in range(1,10):
            if a%i==0 and 1<=a//i<=9:
                return 'Yes'
                break
        return 'No'

print(main())

Solution (Python):
list = []

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

N = int(input())

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

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

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

for i in range(1,10):
    if n%i == 0:
        x = i
        y = n//i
        if y <= 9:
            c += 1

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

Solution (Python):

import sys


YES = "Yes"  
NO = "No"  


def solve(N: int):
    ans=NO
    for i in range(1,10):
        if N%i==0 and N//i<10:
            ans=YES
            break
    print(ans)
    return



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

if __name__ == '__main__':
    main()

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

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

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
print("Yes" if flag else "No")

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

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

can = False
for i, x in enumerate(range(1, 10)):
    for y in range(i+1, 10):
        if x * y == n:
            can = True
            break
    if can:
        break

print('Yes' if can else '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 ii in range(1,10):
    for jj in range(1,10):

        if n == ii * jj:
            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()
print('No')

Solution (Python):
N=int(input())
if N%2==0 and N/2<10:
    print('Yes')
elif N%3==0 and N/3<10:
    print('Yes')
elif N%4==0 and N/4<10:
    print('Yes')
elif N%5==0 and N/5<10:
    print('Yes')
elif N%6==0 and N/6<10:
    print('Yes')
elif N%7==0 and N/7<10:
    print('Yes')
elif N%8==0 and N/8<10:
    print('Yes')
elif N%9==0 and N/9<10:
    print('Yes')
elif N==1:
    print('Yes')
else:
    print('No')

Solution (Python):


N = int(input())

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

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

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

a = list(range(1,10))
b = list(range(1,10))

for i in a:
  for j in b:
    if i*j == n:
      print('Yes')
      sys.exit()
print('No')

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

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

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

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

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

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

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

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

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

Solution (Python):

n = int(input())
status = 0

for i in range(1,10):
    if n % i == 0 and 1 <= n/i <= 9:
        status = 1


        break
    else:
        pass


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

Solution (Python):
MultiTable={}
for i in range(1,10):
    for j in range(1,10):
        MultiTable[i*j]="ANS"
n=int(input())
if n in MultiTable:
    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")
        break
else:
    print("No")

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

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

Solution (Python):
n = int(input())
result = "No"

for i in range(1,10):
    if n % i == 0:
        a = n / i
        
        if a in range(1,10):
            result = "Yes"
            break
    else:
        next
print(result)

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

Solution (Python):

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











import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,log 
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from fractions import gcd
from random import randint
def ceil(a,b): return (a+b-1)//b
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    N=I()
    for i in range(10):
        for j in range(10):
            if i*j==N:
                print("Yes")
                return 
    print("No")
if __name__ == '__main__':
    main()

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

Solution (Python):
def main():
    N = int(input())
    ans = {i*j for i in range(1, 10) for j in range(1, 10)}
    print("Yes" if N in ans else "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())

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

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

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

ans = 100

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

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

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

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

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

kuku = False
for i in range(1, 10):
    if n % i == 0 and n <= i * 9:
        kuku = True
        break
print('Yes' if kuku else 'No')

Solution (Python):
def main():
    N = int(input())
    result = 'No'
    for i in range(9, 0, -1):
        if N % i == 0 and len(str(N // i)) == 1:
            result = 'Yes'
            break
    print(result)


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):
A=[1,2,3,4,5,6,7,8,9]
B=[1,2,3,4,5,6,7,8,9]
C=[]

N=int(input())
for a in A:
    X=N/a
    C.append(X)

for b in B:
    if b in C :
        print("Yes")
        break
    
    if (b==9) and (not b in C):
        print("No")

Solution (Python):

def f(x):
    f = False
    for i in range(1, 10):
        if x%i == 0:
            k = x//i
            if 1<=k & k<=9:
               f = True 
    return f

def main():
    n = int(input())
    if f(n):
        print('Yes')
    else:
        print('No')

main()

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

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

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

print("Yes" if n in [i*j for i in range(1, 10) for j in range(1,10)] else "No")

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

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

    if flag:
        break

if not flag:
    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())

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

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

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

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

Solution (Python):



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

Solution (Python):
p=[]
for i in range(1,10):
  for j in range(1,10):
    p.append(i*j)
n=int(input())
for l in range(len(p)):
  if n==p[l]:
    print('Yes')
    break
  elif l==len(p)-1:
    print('No')