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

Solution (Python):
from sys import exit

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

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

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

Solution (Python):
N=int(input())
ku=[]
for i in range(9):
  for j in range(9):
    ku.append((i+1)*(j+1));
if N in ku:
  print("Yes")
else:
  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())

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

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 i * j == n: ans = "Yes"

print(ans)

Solution (Python):
"""
N = list(map(int,input().split()))
S = [str(input()) for _ in range(N)]
S = [list(map(int,list(input()))) for _ in range(h)] 
print(*S,sep="")
"""

import sys
sys.setrecursionlimit(10**6)
input = lambda: sys.stdin.readline().rstrip()
inf = float("inf") 

n = int(input())

for _ in range(1,10):
    for __ in range(_,10):
        if _*__ == n:
            print("Yes")
            n = 0
            break
if n:
    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())

if 1<= N <= 81:
    for i in reversed(range(1, 10)):
        if N % i == 0:
            check = N/i
            for j in reversed(range(1,10)):
                if check /j == 1:
                    print("Yes")
                    exit()
    print("No")
    
else:
    print("No")

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

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

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

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

Solution (Python):
N=int(input())
ans='No'

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

print(ans)

Solution (Python):

"""
B - 81
https://atcoder.jp/contests/abc144/tasks/abc144_b

"""
import sys


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


def main(args):
    N = int(input())
    ans = solve(N)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

Solution (Python):
def actual(n):
    kuku = []

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

    if n in kuku:
        return 'Yes'

    return 'No'

n = int(input())
print(actual(n))

Solution (Python):
n=int(input())
x_set=set()
for i in range(1,10):
    for j in range(1,10):
        x_set.update({i*j})
if n in x_set:
    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()
else:
    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
            break
if ans == 1:
    print("Yes")
else:
    print("No")

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

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

Solution (Python):
from sys import exit

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

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

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

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

Solution (Python):
N=int(input())
f=0
for x in range(1,10):
	div=N/x
	if div / 9 <= 1 and div==int(div):
		f=1
		break
if f==0:
	print("No")
else:
	print("Yes")

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().rstrip())
for i in range(int(N**0.5),0,-1):
    if N%i==0:
        if i<10 and N//i<10:
            print('Yes')
        else:
            print('No')
        break

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

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

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

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

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

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

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

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

Solution (Python):
import sys

num = int(sys.stdin.readline().rstrip("\n"))

table = []
for i in range(1,10):
    for j in range(i, 10):
        table.append(i * j)
if num in table:
    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())
flag = 0
for i in range(10):
  for j in range(10):
    if N == i * j and flag == 0:
      print("Yes")
      flag += 1
      break
if flag == 0:
  print("No")

Solution (Python):
import sys
import decimal 

def input():
    return sys.stdin.readline().strip()

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

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

a = [1,2,3,4,5,6,7,8,9]
b = [1,2,3,4,5,6,7,8,9]
for i in a:
  for j in b:
    if i * j == n:
      print('Yes')
      exit()
print('No')

Solution (Python):
import sys
N=int(input())
if N==1:
    print('Yes')
    sys.exit()
A=[]
B=list(range(2,10))
B=B[::-1]
for i in B:
    while N%i==0:
        A.append(i)
        N//=i
if N==1 and 1<=len(A) and len(A)<=2:
    print('Yes')
else:
    print('No')

Solution (Python):
N = int(input())
seki = set()
for i in range(9):
    for j in range(9-i):
        seki.add((i+1)*(i+j+1))
if N in seki:
    print("Yes")
else:
    print("No")

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

for i in range(1,n+1):
  for j in range(1,n+1):
    if(i*j == n):
      if(len(str(i)) == 1 and len(str(j)) == 1):
        print("Yes")
        exit()
print("No")

Solution (Python):
import sys
import heapq
import re
from itertools import permutations
from bisect import bisect_left, bisect_right
from collections import Counter, deque
from math import factorial, sqrt, ceil
from functools import lru_cache, reduce
INF = 1 << 60
MOD = 1000000007
sys.setrecursionlimit(10 ** 7)


class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())


def dijkstra_heap(s, edge, n):
    
    d = [10**20] * n
    used = [True] * n 
    d[s] = 0
    used[s] = False
    edgelist = []
    for a,b in edge[s]:
        heapq.heappush(edgelist,a*(10**6)+b)
    while len(edgelist):
        minedge = heapq.heappop(edgelist)
        
        if not used[minedge%(10**6)]:
            continue
        v = minedge%(10**6)
        d[v] = minedge//(10**6)
        used[v] = False
        for e in edge[v]:
            if used[e[1]]:
                heapq.heappush(edgelist,(e[0]+d[v])*(10**6)+e[1])
    return d


def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])

    return arr


def lcm(x, y):
    return (x * y) // gcd(x, y)


def lcm_list(numbers):
    return reduce(lcm, numbers, 1)


def gcd_list(numbers):
    return reduce(gcd, numbers)


def is_prime(n):
    if n <= 1:
        return False
    p = 2
    while True:
        if p ** 2 > n:
            break
        if n % p == 0:
            return False
        p += 1
    return True



def eratosthenes(limit):
    A = [i for i in range(2, limit+1)]
    P = []

    while True:
        prime = min(A)
        
        if prime > sqrt(limit):
            break
            
        P.append(prime)
            
        i = 0
        while i < len(A):
            if A[i] % prime == 0:
                A.pop(i)
                continue
            i += 1
            
    for a in A:
        P.append(a)
            
    return P


def permutation_with_duplicates(L):

    if L == []:
        return [[]]

    else:
        ret = []

        
        S = sorted(set(L))

        for i in S:

            data = L[:]
            data.remove(i)

            for j in permutation_with_duplicates(data):
                ret.append([i] + j)

        return ret



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):
import sys
sys.setrecursionlimit(10**6)

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):
multitable_lst = []
for i in range(10):
    for j in range(10):
        multitable_lst.append(i*j)
n = int(input())
if n in multitable_lst:
    print("Yes")
else:
    print("No")

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

li = [i for i in range(1,10)]
products = [x*y for x in li for y in li]
flag=True
for i in products:
    if N==i:
        print("Yes")
        flag=False
        break
if flag:
    print("No")

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

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

Solution (Python):
lst = [x*y for x in range(1, 10) for y in range(1, 10)]  
n = int(input())
if n in lst:
    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)
print('YNeos'[n not in l::2])

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

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

is_calc = False

for i in range(9, 0, -1):
    if N/i <= 9 and (N/i)%1==0:
        is_calc = True
        break

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

Solution (Python):
n = int(input())
r = (int(n**0.5)+1)
c = 0
for i in range(1,r):
    if n%i == 0 and n/i <10:
        c = 1
        break
    else:
        c = 0
if c == 1:
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
finded = False
for i in range(1,10):
    num = n / i
    if num.is_integer() and num < 10:
        print('Yes')
        finded = True
        break
if not finded:
    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())

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

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

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

Solution (Python):
import itertools
import numpy as np
N = int(input())
S = list(itertools.product(range(1,10),repeat=2))
S = list(map(lambda x: np.product(x), S))
if N in S:
    print('Yes')
else:
    print('No')

Solution (Python):
a = int(input())
i = 1
while i < 10:
  if a%i == 0 and 1<= a//i <=9:
    print("Yes")
    break
  else:
    i += 1
if i >=10:
    print("No")

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

Ans = "No"

for i in range(1, 10):
    for j in range(1, 10):
        ans = i * j
        if ans == N:
            Ans = "Yes"
        else:
             pass

print(Ans)

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

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

l = set(kuku)

if n in l:
    print("Yes")
else:
    print("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):

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

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

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

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

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

for i in range(9):
    if(n % (i+1) == 0):
        if(int(n/(i+1)) < 10):
            print("Yes")
            sys.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):
n = int(input())
check = False
for i in range(1,10):
    for j in range(1,10):
        if i * j == n:
            check = True
if check:
    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')
    break
else:
  print('No')

Solution (Python):
import sys

input = lambda: sys.stdin.readline().rstrip()


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

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

    print('No')



if __name__ == '__main__':
    solve()

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

    for i in range(1, 10):
        for w in range(i, 10):
            if n == i*w:
                return "Yes"

    return "No"

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

if __name__ == '__main__':
    main()

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

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

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

print('No')

Solution (Python):

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines


def main():
    N = int(readline())
    white_list = set(
        [a * b for a in range(1, 10) for b in range(1, 10)]
        )
    if N in white_list:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

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

if triger == 0:
  print("No")

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

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

for i in range(10):
    for j in range(10):
        if n == i*j:
            flg = True

if flg:
    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):
S = int(input())
a = []

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

if S in a:
    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 N == i*j:
            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(0)
        else: pass
print('No')

Solution (Python):
from sys import stdin, setrecursionlimit


def main():
    input = stdin.buffer.readline
    n = int(input())

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


if __name__ == "__main__":
    setrecursionlimit(10000)
    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(1, 10):
        if N == i * j:
            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
if count >= 1:
  print('Yes')
else:
  print('No')

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

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

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

a = 0

for i in range(1, 10):
    for j in range(1,10):
        if n/i==j:
            print("Yes")
            exit()
            a +=1
        else:
            continue

if a == 0:
    print("No")
else:
    exit()

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

print("No")

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

Solution (Python):
import sys
n=int(input())
lista=[i+1 for i in range(9)]

for i in range(9):
    for j in range(9):
        if lista[i]*lista[j] == n:
            print("Yes")
            sys.exit()

print("No")

Solution (Python):
i = int(input())
di = {i * j: 1 for i in range(1, 10) for j in range(1, 10)}

if di.get(i):
    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())

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

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

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

tar = 0
a = [0] * 81
for i in range(1, 10):
    for j in range(1, 10):
        a[tar] = i * j
        tar += 1

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

Solution (Python):
n = int(input().rstrip())
r = 'No'
for i in range(1, 10):
	iby = int(n / i)
	if iby < 10 and (i * iby) == n:
		r = 'Yes'
		break

print(r)

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

if flg:
    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())
A = 0
for i in range(1,10):
  for j in range(1,10):
    x = i * j
    if x == n:
      A += 1
if A >= 1:
  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')

if __name__ == '__main__':
    main()

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

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

for i in range(1,10):
    if a % i == 0 and a < i*10:
        print("Yes")
        judge = 1
        break

if judge == 0:
    print("No")

Solution (Python):

def search(N):
    ans = False
    if not N >= 90:
        for i in range(1,10):
            if N%i == 0 and 1 <= N // i <= 9:
                ans = True
                break
            else:
                pass        
    return ans

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

Solution (Python):
n=int(input())
 
t=[]
for i in range(1,10):
  for j in range(1,10):
    t.append(i*j)

if n in t:
  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())

t = False

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

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

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

Solution (Python):

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

Solution (Python):
N = int(input())
for i in range(9, 0, -1):
    if N%i == 0:
        q = N//i
        break

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

Solution (Python):



import sys
from collections import defaultdict, deque
from heapq import heappush, heappop
import math
import bisect




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):
print("YNeos"[int(input())not in{i*j for j in range(1,10)for i in range(1,10)}::2])

Solution (Python):
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

n = ni()

for i in range(10):
  for j in range(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())

ans = "No"

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

print(ans)

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

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

Solution (Python):
a = int(input())
b = [1,2,3,4,5,6,7,8,9]
x = 0
for i in range(9):
    for j in range(9):
        if a == b[i] * b[j]:
            x = 1
            break
if x == 0:
    print("No")
else:
    print("Yes")

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

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

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

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

Solution (Python):

import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

N = int(read())

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

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

can = False

for i in range(10):
    for j in range(10):
      if(i * j == n):
          can = True
      
if(can):
    print("Yes")
else:
    print("No")

Solution (Python):
import math
N = int(input())
r = math.floor(N**0.5)
i = 1
while i <= r:
  if N % i == 0 and i <= 9 and (N/i) <= 9:
    print('Yes')
    break
  else:
    i += 1
else:
  print('No')

Solution (Python):
def integerornot(n):
    if isinstance(n,int):
        return True
    if isinstance(n,float):
        return n.is_integer()
    return False

n = int(input())
for i in range(1,10):
    if integerornot(n/i) and 1<=n/i<=9:
        print("Yes")
        break
else:
    print("No")

Solution (Python):

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

Solution (Python):



n = int(input())

multi_table = []

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

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

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

Solution (Python):
QQ =[]

for i in range(10):
    for j in range(10):
        if i*j not in QQ:
            QQ.append(i*j)
        else:
            pass

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