import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
sys.set_int_max_str_digits(10**9)

A,B=map(float,input().split())
B=B*10000
A=A*10000
A=round(A)
B=round(B)
ans="No"
if B>=0:
    if A%10000==0:
        A=A//10000
        g=math.gcd(B,10000)
        c=(10000//g)
        Ac=int(A/c)
        for x in range(Ac-3,Ac+4):
            if x**c==A:
                ans="Yes"
if A==10000:
    ans="Yes"
print(ans)