def qh(n):
    s=0
    for i in range(1,n//2+1):
        if(n%i==0):
            s=s+i
    return(s)
sr=input().split()
n1=int(sr[0])
n2=int(sr[1])
s1=qh(n1)
s2=qh(n2)
if(s1==n2 and s2==n1):
    print("yes")
else:
    print("no")
/**************************************************************
	Problem: 1862
	User: admin
	Language: Python
	Result: Accepted
	Time:597 ms
	Memory:34480 kb
****************************************************************/