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

from __future__ import division, print_function
from collections import defaultdict, Counter, deque
from future_builtins import ascii, filter, hex, map, oct, zip
from random import randint
from itertools import imap as map, izip as zip, permutations, combinations, combinations_with_replacement
from __builtin__ import xrange as range
from math import ceil
from _continuation import continulet
from cStringIO import StringIO
from io import IOBase
import __pypy__
from bisect import bisect, insort, bisect_left, bisect_right
import sys
import os
import re
sys.setrecursionlimit(9999)
inf = float('inf')
mod = int(1e9) + 7
mod_ = 998244353
N = 5001
 
'''
Check for special cases (n=1)
One wrong submission = 10 mins penalty!
do smth instead of nothing and stay organized
'''

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


BUFSIZE = 8192
class FastI(IOBase):
	def __init__(self, file):
		self._fd = file.fileno()
		self._buffer = StringIO()
		self.newlines = 0
 
	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
		self.newlines = 0
		return self.buffer.read()
 
	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count("\n") + (not b)
			ptr = self._buffer.tell()
			self._buffer.seek(0, 2), self._buffer.write(
				b), self._buffer.seek(ptr)
		self.newlines -= 1
		return self._buffer.readline()
class FastO(IOBase):
	def __init__(self, file):
		self._fd = file.fileno()
		self._buffer = __pypy__.builders.StringBuilder()
		self.write = lambda s: self._buffer.append(s)
 
	def flush(self):
		os.write(self._fd, self._buffer.build())
		self._buffer = __pypy__.builders.StringBuilder()
def print(*args, **kwargs):
	sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
	at_start = True
	for x in args:
		if not at_start:
			file.write(sep)
		file.write(str(x))
		at_start = False
	file.write(kwargs.pop("end", "\n"))
	if kwargs.pop("flush", False):
		file.flush()
def gcd(x, y):
	while y:
		x, y = y, x % y
	return x
sys.stdin, sys.stdout = FastI(sys.stdin), FastO(sys.stdout)
def input(): return sys.stdin.readline().rstrip("\r\n")
if __name__ == "__main__":
	def bootstrap(cont):
		call, arg = cont.switch()
		while True:
			call, arg = cont.switch(to=continulet(
				lambda _, f, args: f(*args), call, arg))
	cont = continulet(bootstrap)
	cont.switch()
	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 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()
print('No')

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

N = int(input())

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

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

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


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


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

kuku = set()

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

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

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

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

print('No')
exit()

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

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


print("No")

Solution (Python):
import sys

def input(): return sys.stdin.readline()[:-1]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def MATINT(h): return [list(map(int, input().split())) for _ in range(h)]
def MATSTR(h): return [input() for _ in range(h)]
sys.setrecursionlimit(10 ** 9)
inf = float('inf')
mod = 10 ** 9 + 7

N = INT()

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

Solution (Python):
import sys

sys.setrecursionlimit(10**7)
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 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):
import sys
n=int(input())
l=[]
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):
    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):
def MAP(): return list(map(int,input().split()))
def INT(): return int(input())
def FLOAT(): return float(input())
MOD = 10**9+7

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

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

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

ans99 = set()

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

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

Solution (Python):
import sys
def input():
    return sys.stdin.readline()[:-1]
n=int(input())
for i in range(1,10):
    if n%i==0 and n//i<10:
        print("Yes")
        quit()
print("No")

Solution (Python):
N = int(input())
for a in range(1, 10):
    c = N%a
    if c != 0:
        continue
    b = N/a

    if 1 <= b <= 9:
        print('Yes')
        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(0)
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(i, 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 0<n//i<10:
    print("Yes")
    exit()
print("No")

Solution (Python):

import sys

YES = "Yes"  
NO = "No"  


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



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

if __name__ == '__main__':
    main()

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

n = int(input())
if n in d:
    print("Yes")
else:
    print("No")

Solution (Python):
l = []

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

print("Yes" if int(input()) in l else "No")

Solution (Python):

from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,copy,time
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())

N = inp()

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

print('No')

Solution (Python):

import sys
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
INF = 10**9

n = int(input())
ok = False
for i in range(1, 10):
    for j in range(1, 10):
        if n == i*j:
            ok = True
if ok:
    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):
def main():
    N = int(input())
    for i in range(1, 10):
        if N % i == 0 and N // i < 10:
            return "Yes"
    return "No"

if __name__ == '__main__':
    print(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):
s=set()
for i in range(1,10):
    for j in range(1,10):
        s.add(i*j)
n=int(input())
if(n in s):
    print('Yes')
else:
    print('No')

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

print('Yes' if flg else 'No')

Solution (Python):



N = int(input())


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


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

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

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

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

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

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


print(main())

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

f=False

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

print('Yes' if f else 'No')

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

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

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

ok = False
for n in range(1, 10):
    if N%n == 0 and N//n < 10:
        ok = True

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

Solution (Python):
klist=[]

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

n=int(input())
if n in klist:
    print("Yes")
else:
    print("No")

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

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

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 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())
output = "No"

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

print(output)

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

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

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

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

sys.setrecursionlimit(10 ** 7)

def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x) - 1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

n = ni()

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

print("Yes" if n in ok_set else "No")

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
print('Yes' if flg else 'No')

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

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

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

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

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

Solution (Python):
import sys

stdin = sys.stdin

ns = lambda : stdin.readline().rstrip()
ni = lambda : int(ns())
na = lambda : list(map(int, stdin.readline().split()))
sys.setrecursionlimit(10 ** 7)

def main():
  n = ni()

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

main()

Solution (Python):
N, = (int(x) for x in input().split())

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10000000)
def input():
    return sys.stdin.readline()[:-1]








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

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

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

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

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

Solution (Python):
from collections import Counter,defaultdict,deque
import sys,bisect,math,itertools,string,queue
from heapq import heappop, heappush
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

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

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

Solution (Python):
import sys

N = int(input())

for i in range(9):
    i += 1

    for j in range(9):
        j += 1

        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 n // i <= 9:
            print('Yes')
            exit()
print('No')

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

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

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

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

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

for i in range(1, 10):
  a = N // i
  if a * i == N and a >= 1 and a <= 9:
    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 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):
    for j in range(1,10):
        if i*j==n:
            print('Yes')
            break
    else:
        continue
    break
else:
    print('No')

Solution (Python):

from collections import  Counter

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 a in range(1,10):
    if N%a==0 and 1<=(N//a)<=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()
print("No")

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
    s=set()
    for i in range(1,10):
        for j in range(1,10):
            s.add(i*j)
    n=int(input())
    print("Yes" if n in s else "No")
resolve()

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

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

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 permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
from bisect import bisect

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()))
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")
			sys.exit()
else:
	print("No")

Solution (Python):
import sys
from heapq import heappop, heappush
from operator import itemgetter
from collections import deque, defaultdict, Counter
from bisect import bisect_left, bisect_right
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
MOD = 10**9 + 7
INF = float('inf')

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

    for i in range(1, 101):
        if N % i == 0:
            M = N // i
            if 1 <= M <= 9 and 1 <= i <= 9:
                print('Yes')
                return
    print('No')


sol()

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 (1<=n//i<=9):
    print("Yes");exit()
print("No")

Solution (Python):
import sys
import math
from collections import defaultdict

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def II(): return map(int, input().split())
def III(): return list(map(int, input().split()))
def Line(N,num):
    if N<=0:
        return [[]]*num
    elif num==1:
        return [I() for _ in range(N)]
    else:
        read_all = [tuple(II()) for _ in range(N)]
        return map(list, zip(*read_all))



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

Solution (Python):
import math

def makelist(n, m):
    return [[0 for _ in range(m)] for _ in range(n)]





ans = "No"

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)

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

main()

Solution (Python):
from fractions import gcd
from datetime import date, timedelta
from heapq import*
import math
from collections import defaultdict, Counter, deque
import sys
from bisect import *
import itertools
import copy
sys.setrecursionlimit(10 ** 7)
MOD = 10 ** 9 + 7


def main():
    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__':
    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 i*j == N:
            print('Yes')
            exit()
print('No')

Solution (Python):

import sys
INF = float("inf")


def yes():
    print("Yes")  


def no():
    print("No")  


def solve(N: int):

    ans = []
    for i in range(1, 10):
        for j in range(1, 10):
            ans.append(i*j)
    if N in ans:
        yes()
    else:
        no()

    return


def main():

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


if __name__ == '__main__':
    main()

Solution (Python):
n=int(input())
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):

from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    n = I()
    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__":
    solve()

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())
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 i * j == n:
            print('Yes')
            exit()
print('No')

Solution (Python):


from collections import deque, defaultdict
import itertools as ite
import sys
import math
import decimal

sys.setrecursionlimit(1000000)

INF = 10 ** 18
MOD = 10 ** 9 + 7

m = set(i * j for i in range(1, 10) for j in range(1, 10))
if input() in m:
    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)