18 12

2 3

Yes

No

#include<map>

#include<set>

#include<ctime>

#include<cmath>

#include<queue>

#include<bitset>

#include<string>

#include<vector>

#include<cstdio>

#include<cstring>

#include<iostream>

#include<algorithm>

#include<functional>

using namespace std;

#define inf 0x3f3f3f3f

long long gcd(long long a,long long b)

{

    return b==0?a:gcd(b,a%b);

}

int main()

{

    long long x,y;

    while(~scanf("%lld%lld",&x,&y))

    {

        long long t=gcd(x,y);

        x/=t;

        y/=t;

        long long a;

        while(x!=1)

        {

            a=gcd(t,x);

            if(a==1) break;

            x/=a;

        }

        while(y!=1)

        {

            a=gcd(t,y);

            if(a==1) break;

            y/=a;

        }

        if(x!=1||y!=1)

            printf("No\n");

        else

            printf("Yes\n");

    }

    return 0;

}