#![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 factorize(mut n: i64) -> Vec<(i64, i64)> {
    let mut factors = Vec::new();

    let small_primes = [
        2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89,
        97,
    ];
    for &p in &small_primes {
        if p * p > n {
            break;
        }
        let mut count = 0;
        while n % p == 0 {
            count += 1;
            n /= p;
        }
        if count > 0 {
            factors.push((p, count));
        }
    }

    let mut p = 101;
    while p * p <= n {
        if n % p == 0 {
            let mut count = 0;
            while n % p == 0 {
                count += 1;
                n /= p;
            }
            factors.push((p, count));
        }
        p += 2;
    }
    if n > 1 {
        factors.push((n, 1));
    }
    factors
}

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 stdin = io::stdin();
    let mut lines = stdin.lock().lines();

    if let Some(Ok(line)) = lines.next() {
        let parts: Vec<&str> = line.trim().split_whitespace().collect();
        if parts.len() != 2 {
            println!("No");
            return;
        }
        let a_str = parts[0];
        let b_str = parts[1];

        let (a_num, a_den) = parse_fraction(a_str);
        let (b_num, b_den) = parse_fraction(b_str);

        let gcd_a = gcd(a_num.abs(), a_den);
        let a_reduced = (a_num / gcd_a, a_den / gcd_a);

        let gcd_b = gcd(b_num.abs(), b_den);
        let b_reduced = (b_num / gcd_b, b_den / gcd_b);

        let c = b_reduced.0;
        let d = b_reduced.1;

        if c == 0 {
            println!("Yes");
            return;
        }

        let a_val = a_reduced.0;
        let b_val = a_reduced.1;

        let factors_a = factorize(a_val);
        let factors_b = factorize(b_val);

        if !check_perfect_power(&factors_a, d) || !check_perfect_power(&factors_b, d) {
            println!("No");
            return;
        }

        let x = compute_root(&factors_a, d);
        let y = compute_root(&factors_b, d);

        if x % y != 0 {
            println!("No");
            return;
        }

        println!("Yes");
    } else {
        println!("No");
    }
}