#![allow(dead_code)]
#![allow(unused_imports)]
#![allow(unused_macros)]

use std::cmp::*;
use std::fmt::*;
use std::hash::*;
use std::io::BufRead;
use std::iter::FromIterator;
use std::*;
use std::{cmp, collections, fmt, io, iter, ops, str};
const INF: i64 = 1223372036854775807;
const UINF: usize = INF as usize;
const LINF: i64 = 2147483647;
const INF128: i128 = 1223372036854775807000000000000;
const MOD1: i64 = 1000000007;
const MOD9: i64 = 998244353;
const MOD: i64 = MOD9;
const UMOD: usize = MOD as usize;
const M_PI: f64 = 3.14159265358979323846;

use cmp::Ordering::*;
use std::collections::*;

use std::io::stdin;
use std::io::stdout;
use std::io::Write;

macro_rules! p {
    ($x:expr) => {
        println!("{}", $x);
    };
}

macro_rules! vp {
    ($x:expr) => {
        println!(
            "{}",
            $x.iter()
                .map(|x| x.to_string())
                .collect::<Vec<_>>()
                .join(" ")
        );
    };
}

macro_rules! d {
    ($x:expr) => {
        eprintln!("{:?}", $x);
    };
}
macro_rules! yn {
    ($val:expr) => {
        if $val {
            println!("Yes");
        } else {
            println!("No");
        }
    };
}

macro_rules! map{

    ($($key:expr => $val:expr),*) => {
        {
            let mut map = ::std::collections::BTreeMap::new();
            $(
                map.insert($key, $val);
            )*
            map
        }
    };
}

macro_rules! set{

    ($($key:expr),*) => {
        {
            let mut set = ::std::collections::BTreeSet::new();
            $(
                set.insert($key);
            )*
            set
        }
    };
}

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

#[allow(dead_code)]
fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}

#[allow(dead_code)]
fn read_mat<T: std::str::FromStr>(n: usize) -> Vec<Vec<T>> {
    (0..n).map(|_| read_vec()).collect()
}

#[allow(dead_code)]
fn readii() -> (i64, i64) {
    let mut vec: Vec<i64> = read_vec();
    (vec[0], vec[1])
}

#[allow(dead_code)]
fn readiii() -> (i64, i64, i64) {
    let mut vec: Vec<i64> = read_vec();
    (vec[0], vec[1], vec[2])
}
#[allow(dead_code)]
fn readuu() -> (usize, usize) {
    let mut vec: Vec<usize> = read_vec();
    (vec[0], vec[1])
}

#[allow(dead_code)]
fn readff() -> (f64, f64) {
    let mut vec: Vec<f64> = read_vec();
    (vec[0], vec[1])
}

fn readcc() -> (char, char) {
    let mut vec: Vec<char> = read_vec();
    (vec[0], vec[1])
}

fn readuuu() -> (usize, usize, usize) {
    let mut vec: Vec<usize> = read_vec();
    (vec[0], vec[1], vec[2])
}
#[allow(dead_code)]
fn readiiii() -> (i64, i64, i64, i64) {
    let mut vec: Vec<i64> = read_vec();
    (vec[0], vec[1], vec[2], vec[3])
}

#[allow(dead_code)]
fn readuuuu() -> (usize, usize, usize, usize) {
    let mut vec: Vec<usize> = read_vec();
    (vec[0], vec[1], vec[2], vec[3])
}

fn gcd(mut a: i64, mut b: i64) -> i64 {
    while b != 0 {
        let temp = a % b;
        a = b;
        b = temp;
    }
    a.abs()
}

fn parse_fraction(s: &str) -> (i64, i64) {
    if let Some(dot_pos) = s.find('.') {
        let decimal_digits = s.len() - dot_pos - 1;
        let decimal_digits = decimal_digits.min(4);
        let scale = 10_i64.pow(decimal_digits as u32);
        let numerator: i64 = s.replace(".", "").parse().unwrap();
        let denominator = scale;
        let common_gcd = gcd(numerator.abs(), denominator);
        (numerator / common_gcd, denominator / common_gcd)
    } else {
        let numerator: i64 = s.parse().unwrap();
        (numerator, 1)
    }
}

fn prime_factorization(x: usize) -> BTreeMap<usize, usize> {
    let mut res: BTreeMap<usize, usize> = BTreeMap::new();
    let mut xx = x;
    let mut p: usize = 2;
    while p * p <= xx {
        while xx % p == 0 {
            // println!("{:?}", p);
            let t = res.get_mut(&p);
            if t.is_none() {
                res.insert(p, 1);
            } else {
                *t.unwrap() += 1;
            }
            xx /= p;
        }
        // println!("{:?} {:?}", p, res);
        p += 1;
    }

    if xx != 1 {
        let t = res.get_mut(&xx);
        if t.is_none() {
            res.insert(xx, 1);
        } else {
            *t.unwrap() += 1;
        }
    }
    res
}

fn check_perfect_power(factors: &Vec<(i64, i64)>, d: i64) -> bool {
    for &(_, exp) in factors {
        if exp % d != 0 {
            return false;
        }
    }
    true
}

fn compute_root(factors: &Vec<(i64, i64)>, d: i64) -> i64 {
    let mut res = 1;
    for &(p, e) in factors {
        res *= p.pow((e / d) as u32);
    }
    res
}

fn main() {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).unwrap();
    let mut s = s.split_whitespace();
    let mut af: f64 = s.next().unwrap().parse().unwrap();
    let mut bf: f64 = s.next().unwrap().parse().unwrap();
    let an = (af * 10000.0) as i64;
    let mut bn = (bf * 10000.0) as i64;
    let ad = 10000;
    let mut bd = 10000;
    if bn < 0 {
        let tmp = bn;
        bd = -tmp;
        bn = 10000;
    }
    let a = (an, ad);
    let b = (bn, bd);
    let a_reduced = (a.0 / gcd(a.0, a.1), a.1 / gcd(a.0, a.1));
    let b_reduced = (b.0 / gcd(b.0, b.1), b.1 / gcd(b.0, b.1));
    let a1 = a_reduced.0;
    let a2 = a_reduced.1;
    let b1 = b_reduced.0;
    let b2 = b_reduced.1;
    // let factors_a = factorize(a1);
    let factors_a_map = prime_factorization(a1 as usize);
    let factors_a: Vec<(i64, i64)> = factors_a_map
        .iter()
        .map(|(k, v)| (*k as i64, *v as i64))
        .collect();
    // dbg!((a1, a2, b1, b2));
    if a1 == 1 && a2 == 1 {
        p!("Yes");
        return;
    }
    if b1 == 0 {
        p!("Yes");
        return;
    }
    if a2 != 1 {
        p!("No");
        return;
    }

    for (p, e) in factors_a {
        if p == 1 {
            continue;
        }
        if (e * b1) % b2 != 0 {
            p!("No");
            return;
        }
    }

    p!("Yes");
}