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 Rust (1.15.1) (judge verdict: Wrong Answer)

use std::io;

fn main() {
    real_main();
}

fn real_main() -> i32 {
    let num = read::<i32>();

    if num > 81 {
        println!("No");
        return 0
    } else if num < 1 {
        println!("No");
        return 0
    } else if num == 1 {
        println!("Yes");
        return 0
    }

    for i in (1..10).rev(){
        if num % i == 0{
            let num2 = num / i;
            for j in (1..i).rev(){
                if num2 / j == 1{
                    println!("Yes");
                    return 0
                }
            }
        }
    }
    println!("No");
    return 0
}

fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}