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



Sample input:
10


Sample output:
Yes

Submission status: Accepted

Solution code:
n = int(input())

flag = False
for i in range(1, 11):
  m = n // i
  r = n % i
  if r == 0 and m < 10 and i < 10:
    print ('Yes')
    flag = True
    break;

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
N = int(input())

l = [i for i in range(1, int(N**0.5) + 1) if N % i == 0]
n = N / l[-1]
if n < 10 and l[-1] < 10:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

def Main(n):
    ans = False
    for i in range(1, 10):
        if(n % i == 0):
            nn = n // i
            if(nn >= 10):
                ans = False
                continue
            if(n % nn == 0):
                ans = True
                break
    return 'Yes' if ans else 'No'
        

def main():
    N = int(input())
    print(Main(N))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import numpy as np

n = int(input())
answer = [[i * j for j in range(1, 10)] for i in range(1, 10)]

flag = 0
for ans in answer:
  for a in ans:
    if a == n:
        flag=1
        break

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

Submission status: Accepted

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

if count == 0:
  print('No')

Submission status: Accepted

Solution code:
N = str(input())

l = []
a = 0
b = 0

for i in range(9):
    for j in range(9):
        l.append(str((i+1)*(j+1)))
e = N in l

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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, accumulate
from operator import itemgetter, mul
from copy import deepcopy,copy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd

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

def main():
    n = INT()
    if n == 1:
        print('Yes')
        sys.exit()
    for i in range(2, 10):
        if n % i ==0:
            if n / i < 10:
                print('Yes')
                sys.exit()

    print('No')

if  __name__=='__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

for i in range(2, N+1):
    if N%i == 0:
        a = i
        b = N//i
        if a <= 9 and b <= 9:
            break

if N <= 2:
    print("Yes")
elif a <= 9 and b <= 9:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

if flag == 0:
    print('No')

Submission status: Accepted

Solution code:
nums = [1, 2, 3, 4, 5, 6, 7, 8, 9,
        2, 4, 6, 8, 10, 12, 14, 16, 18,
        3, 6, 9, 12, 15, 18, 21, 24, 27,
        4, 8, 12, 16, 20, 24, 28, 32, 36,
        5, 10, 15, 20, 25, 30, 35, 40, 45,
        6, 12, 18, 24, 30, 36, 42, 48, 54,
        7, 14, 21, 28, 35, 42, 49, 56, 63,
        8, 16, 24, 32, 40, 48, 56, 64, 72,
        9, 18, 27, 36, 45, 54, 63, 72, 81]

if int(input()) in nums:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
# B 81
def calc():
    for i in range(1, 10):
        if A % i == 0:
            x = A / i
            if x >= 0 and x < 10:
                print('Yes')
                return
    
    print('No')

if __name__ == "__main__":
    A = int(input())
    calc()

Submission status: Accepted

Solution code:
n=int(input())
count=0
for i in range(9):
    for j in range(9):
        if (i+1)*(j+1)==n:
            count+=1
if count<1:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
N = int(raw_input())

for i in range(1, 10):
    m = (N / float(i))
    if m.is_integer() and 1 <= m <= 9:
        print('Yes')
        break
else:
    print('No')

Submission status: Accepted

Solution code:
N=int(input())

if N>81:
  print('No')
else:  
  count=0
  for i in range(1,10):
    for j in range(1,10):
      if i*j==N:
        count+=1
  if count>0:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

Solution code:
import sys
N = int(input())
for i in reversed(range(1, 10)):
    j = N / i
    if j.is_integer() and 1 <= j <= 9:
        print('Yes')
        sys.exit()
    else: continue
print('No')

Submission status: Accepted

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

print("No")

Submission status: Accepted

Solution code:
n = int(input())
if n==1:
    print('Yes')
    exit()
for i in range(1,n):
    a = n//i
    if n==a*i and a<10 and i<10:
        print('Yes')
        exit()

print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=[]
ans=a

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

n=int(input())
if n in ans:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())
a=[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 n in a:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
n=int(input())
a=False

for i in range(9,0,-1):
    if n%i ==0 and 1<=n//i<=9:
        a=True

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

Submission status: Accepted

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

n = int(input())

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

Submission status: Accepted

Solution code:
from copy import deepcopy
from sys import exit,setrecursionlimit
import math
from collections import defaultdict,Counter,deque
from itertools import permutations, combinations,combinations_with_replacement,product
from fractions import Fraction as frac
import bisect
import heapq

import logging
logging.basicConfig(level=logging.DEBUG)

import sys
#input = sys.stdin.readline().rstrip

setrecursionlimit(1000000)

MOD = 10**9+7
INF = float('inf')

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

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

Submission status: Accepted

Solution code:
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 == 0:
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
i = input()
A = int(i.split(' ')[0])

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

print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
l = [a * b for a in range(1,10) for b in range(1, 10)]
if n in l:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
n = int(input())

found = False

for i in range(1,10):
	if n%i == 0:
		if n//i < 10:
			found = True
			break

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

Submission status: Accepted

Solution code:
N = int(input())

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

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

Submission status: Accepted

Solution code:
n = int(input())
if n > 81:
    print("No")
else:
    is_ok = False
    for x in range(1, 10):
        if n % x == 0 and n // x <= 9:
            is_ok = True
            break
    if is_ok:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
N = int(input())
printed = False
try:
    for i in range(1, 10):
        for j in range(1, 10):
            if N == i * j:
                print('Yes')
                printed = True
                raise Exception
except Exception:
    pass

if not printed:
    print('No')

Submission status: Accepted

Solution code:
a=int(input())
b=0
for i in range(9):
    if a%(i+1)==0 and a/(i+1)<10:
        b=1
if b!=1:
    print("No")
else:
	print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    import sys
    input = sys.stdin.readline


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

Submission status: Accepted

Solution code:
N = int(input())

for i in range(1, 11):
    if i == 10:
        print('No')
    elif N % i == 0 and N // i <= 9 and N // i > 0:
        print('Yes')
        break

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
kuku_list = []
for i in range(1,10):
    for j in range(1,10):
        kuku_list.append(i*j)
n = int(input())
if n in kuku_list:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())
kk = [a*b for a in range(1,10)
          for b in range(1,10)]
if N in kk:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
flag = True

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

if flag:
    print("No")

Submission status: Accepted

Solution code:
N = int(input())

aa = set()
for i in range(1,10):
    for k in range(1,10):
        aa.add(i*k)

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
n=int(input())
set=set()

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n = int(input())

r = False

if n > 81:
  r = False
else:
  for i in range(1, 10):
    for j in range(1, 10):
      if i*j == n:
        r = True
        
if r:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N=int(input())
a=0
for i in range(9,1,-1):
    if N%i!=0:
        continue
    if 1<=N//i<=9:
        print("Yes")
        a=1
        break
    else:
        print("No")
        a=1
        break
if a==0:
    if N==1:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
N=int(input())
p=0
q=N//10
for i in range(q+1,10):
  if N%i==0:
    p=p+1
  else:
    p=p

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

Solution code:
A = int(input())
for i in range(9):
  if A % (i+1) == 0 and A // (i+1) < 10:
    print('Yes')
    break
  if i == 8:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
flag = 0
for i in range(9):
  if n % (i+1) == 0:
    a = n // (i+1)
    if a < 10:
      flag = 1
      break

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

Submission status: Accepted

Solution code:
# B - 81
N = int(input())

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

if N > 81:
    print('No')
else:
    if hantei[N]:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
n = int(input())
a=0

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sun Oct 27 21:03:22 2019

@author: doppe
"""

N = int(input())

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

Submission status: Accepted

Solution code:
def f(n, k):
        if len(str(n//k))==1 and n%k==0:
                return True
        else:
                return False
n = int(input())

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

Submission status: Accepted

Solution code:
n = int(input())
f = False
for i in range(1, 10):
    if n % i == 0 and 1 <= n // i <= 9:
        f = True
print('Yes' if f else 'No')

Submission status: Accepted

Solution code:
n = int(input())
 
x = [i * j for i in range(1,10) for j in range(1,10)]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

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

    li = []
    flag = 0

    def check(x):
        return x >= 1 and x < 10

    for i in reversed(range(1, 10)):
        if n % i == 0:
            x = n // i
            if check(x):
                print("Yes")
                flag = 1
                break
            else:
                print("No")
                flag = 1
                break


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




if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:

N = int(input())

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

Submission status: Accepted

Solution code:
n=int(input())
ans=0
for i in range(1,10):
    x=n//i
    if x<=9 and x*i==n:
        print("Yes")
        exit()

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

Submission status: Accepted

Solution code:
N = int(input())

ret = False

for i in range(1,10):
  if N % i == 0:
    if N // i < 10:
      ret = True
      break

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
a = 0
for x in reversed(range(1,10)):
  if n % x == 0 and n / x < 10:
    print("Yes")
    a = 1
    break
if a == 0:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
s=list(map(int,input().split()))
a=int(s[0])
b=0
for i in range(10):
	if i!=0 and a%i==0:
        	if a/i<10:
        		b=1
if b==1:
	print('Yes')
else:
	print('No')

Submission status: Accepted

Solution code:
n = int(input())
#a ,b  = list(map(int,input().split()))
list = []
judge = False
for i in range(9):
    for j in range(9):
        list.append((i+1)*(j+1))
for i in range(len(list)):
    if list[i] == n:
        judge = True
if judge == True:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
n = int(input())
kuku = []
for i in range(10):
    for j in range(10):
        kuku.append(i*j)
kuku = set(kuku)

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

Submission status: Accepted

Solution code:
import sys
n = int(input())
for i in range(1, 10):
    for l in range(1, 10):
        if n == i*l:
            print('Yes')
            sys.exit()
print('No')

Submission status: Accepted

Solution code:
n = int(input())
flag = 0
for i in range(1,10):
  if n % i == 0 and n // i <= 9:
    flag += 1
if flag != 0:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
N = int(input())
flg = 0

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

Submission status: Accepted

Solution code:
x = int(input())

tmp = []

for i in range(1,10):
  for l in range(1,10):
    tmp.append(i*l)

cnt = 0
    
for n in tmp:
  if n == x:
    cnt += 1
    
if cnt == 0:
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
from collections import defaultdict, deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys
import random
import itertools
import math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt


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


def LF(): return list(map(float, input().split()))


def LI_(): return list(map(lambda x: int(x)-1, input().split()))


def II(): return int(input())


def IF(): return float(input())


def LS(): return list(map(list, input().split()))


def S(): return list(input().rstrip())


def IR(n): return [II() for _ in range(n)]


def LIR(n): return [LI() for _ in range(n)]


def FR(n): return [IF() for _ in range(n)]


def LFR(n): return [LI() for _ in range(n)]


def LIR_(n): return [LI_() for _ in range(n)]


def SR(n): return [S() for _ in range(n)]


def LSR(n): return [LS() for _ in range(n)]


def gcd(x, y):
    if y == 0:
        return x
    return gcd(y, x % y)


def my_index_multi(l, x):
    return [i for i, _x in enumerate(l) if _x == x]


def sosu(x):
    for i in range(2, int(sqrt(x)+1)):
        if x % i == 0:
            return False
    return True


mod = 1000000007
inf = float('INF')


def A():
    A, B = LI()

    if A >= 1 and A <= 9 and B >= 1 and B <= 9:
        print(A*B)
    else:
        print(-1)
    return

# B


def B():
    N = II()
    if N <= 81 and N > 9:
        for i in range(2, 10):
            if N % i == 0 and N/i <= 9:
                print('Yes')
                return

    elif N > 81:
        print('No')
        return
    else:
        print('Yes')
        return
    print('No')

    return

# C


def C():
    N = II()
    S = input()
    c = 0
    count = 0
    for i in S:
        if i != c:
            count += 1
        c = i
    print(count-1)

    return

# D


def D():
    N = II()
    L = LI()
    L.sort()

    count = 0
    for i in range(N-2):

        for j in range(i+1, N-1):

            p = L[i]+L[j]

            count += sum(x < p for x in L)-j-1

    print(count)

    return

# E


def E():
    N, M = LI()
    bit_max = 1 << N
    dp = [[inf for i in range(bit_max)] for j in range(M+1)]
    dp[0][0] = 0

    for i in range(M):
        a, b = LI()

        c = LI()
        bit = 0

        for d in c:
            bit |= 1 << (d-1)

        for w in range(bit_max):

            t = w | bit
            cost = dp[i][w] + a

            dp[i+1][t] = min(dp[i+1][t], cost)

            dp[i+1][w] = min(dp[i][w], dp[i+1][w])

    print(-1) if dp[-1][-1] == inf else print(dp[-1][-1])

    return

# F


def F():
    N, M = LI()

    value = [0] * M
    power = [0] * M
    for i in range(M):
        a, b = LI()
        value[i] = a
        c = LI()
        L = ['0'] * N
        for k in c:
            L[k - 1] = '1'
        bint = ''.join(L)
        power[i] = int(bint, 2)
    bint = ''.join(list(['1'] * N))
    dp = [inf] * (int(bint, 2)+1)
    t = 0
    cost = 0

    dp[0] = 0
    for s in range(int(bint, 2) + 1):
        for i in range(M):
            t = s | power[i]
            cost = dp[s] + value[i]
            dp[t] = min(dp[t], cost)
    print(-1) if(dp[-1] == inf) else print(dp[-1])

    return

    # you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")


def solution(S):
    # write your code in Python 3.6
    N = len(S)

    pass


# Solve
if __name__ == '__main__':
    B()

Submission status: Accepted

Solution code:
N=int(input())

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

print(result)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
if 81 < N:
  print("No")
  exit(0)
for i in range(1, 10):
  for j in range(1, 10):
    if i * j == N:
      print("Yes")
      exit(0)
print("No")

Submission status: Accepted

Solution code:
N = int(input())

def main():
    for i in range(1, 10):
        if N % i == 0:
            a = N // i
            if N % a == 0 and a < 10 and a >= 1:
                print('Yes')
                return
    print('No')
    
main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
kk={}
for a in range(10):
    for b in range(10):
        kk[a*b]=1
x=int(input())
if x in kk:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
a = [i for i in range(1,10)]
b = [j for j in range(1,10)]
s = []
for k in a:
    for l in b:
        m = k*l
        s.append(m)
print("Yes" if n in s else "No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

from itertools import combinations


ls = []

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


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

Submission status: Accepted

Solution code:
n = int(input())
flg = 0
for a in range(1, 10):
  for b in range(1, 10):
    if a * b == n and flg == 0:
      print("Yes")
      flg = 1
if flg == 0:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
ichi = [1,2,3,4,5,6,7,8,9]
ni = [2,4,6,8,10,12,14,16,18]
san = [i for i in range(3, 30, 3)]
yon = [i for i in range(4, 40, 4)]
go = [i for i in range(5, 50, 5)]
roku = [i for i in range(6, 60, 6)]
nana = [i for i in range(7, 70, 7)]
hachi =[i for i in range(8, 80, 8)]
kyu = [i for i in range(9, 90, 9)]

if N in ichi+ni+san+yon+go+roku+nana+hachi+kyu:
    print('Yes')
else:
    print("No")

Submission status: Accepted

Solution code:
def eighty_one(a):
    for n in range(1, 10):
        if a % n != 0:
            continue
        elif a / n >= 10:
            continue
        else:
            return True
    return False

n = int(input())
if eighty_one(n):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
N = int(input())

hoge = [0] * 81

for i in range(9):
    for j in range(9):
        hoge[9*i+j] = (i+1)*(j+1)

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

Submission status: Accepted

Solution code:
N = int(input())
ans = "No"
for i in range(9):
    if N/(i+1) in [1,2,3,4,5,6,7,8,9]:
        ans = "Yes"
        break
print(ans)

Submission status: Accepted

Solution code:
n = int(input())

kuku = []

for v1 in range(1,10):
  for v2 in range(1,10):
    kuku.append(v1 * v2)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())
list=[]
for t in range(1,10):
  for i in range(1,10):
      list+=[t*i]
if N in list:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
N = int(input())

flag = False

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
n = int(input())

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

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(4000000)
import itertools

n = int(input())

a = range(1, 10)
b = range(1, 10)
L = [x[0]*x[1] for x in itertools.product(a, b)]
if n in L:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
for i in range(1, 10):
  x = n//i
  y = n%i
  if y == 0 and 1 <= x and x <= 9:
    print('Yes')
    exit()
else:
  print('No')

Submission status: Accepted

Solution code:
ans = [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]
a = int(input())
if a in ans:
	print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
n = int(input())

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