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 in C# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;
using System.IO;
using System.Linq;
using System.Collections.Generic;
using System.Numerics;

namespace abc144
{
    class Program
    {
        static void Main(string[] args)
        {
            //Console.SetIn(new StreamReader("input.txt"));
            solve_abc144B();
        }

        public static void solve_abc144C()
        {
        }

        public static void solve_abc144B()
        {
            int n = Convert.ToInt32(Console.ReadLine());

            bool ok = false;
            for (int i = 1; i <= 9; i++)
            {
                for (int j = 1; j <= 9; j++)
                {
                    if (i * j == n)
                    {
                        Console.WriteLine("Yes");
                        ok = true;
                        break;
                    }
                    if (ok)
                    {
                        break;
                    }
                }
            }

            if (!ok)
            {
                Console.WriteLine("No");
            }
        }

        public static void solve_abc144A()
        {
            int[] ab = Array.ConvertAll(Console.ReadLine().Split(), int.Parse);

            int a = ab[0];
            int b = ab[1];

            Console.WriteLine(a < 10 && b < 10 ? a * b : -1);
        }

        /*
            BinarySearchIterativeLeft
         */
        public static int binarySearchIterativeLeft(long[] haystack, long needle)
        {
            int left = -1;
            int right = haystack.Length;
            while (left < right - 1)
            {
                int middle = left + (right - left) / 2;
 
                if (haystack[middle] < needle)
                {
                    left = middle;
                }
                else
                {
                    right = middle;
                }
            }
 
            return right;
        }
        
        public static int binSearch(int[] haystack, int needle)
        {
            int l = -1;
            int r = haystack.Length;
            while(l < r - 1)
            {
                int mid = (r + l) / 2;
                if (haystack[mid] <= needle)
                {
                    l = mid;
                }
                else 
                {
                    r = mid;
                }
            }
 
            return r;
        }                        
    }
}