#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define pb push_back
#define ump unordered_map
#define loop(i, a, n) for(long long i=a; i<=n; i++)
#define ub upper_bound
#define lb lower_bound
#define vi vector<long long>
const long long MOD = 1e9+7;
const long long INF = LLONG_MAX;
const long long NINF = LLONG_MIN;

int main(){

	ll h,m;
	cin >>m >>h;

	if(h%m == 0)
		cout << "Yes";
	else
		cout << "No";
	
}
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(ll i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
constexpr ll MOD=3;
constexpr ll INF=2e18;

ll power(ll x, ll y){
    x%=MOD;
    ll ret=1;
    while(y){
        if(y&1) ret=ret*x%MOD;
        x=x*x%MOD;
        y>>=1;
    }
    return ret;
}
ll divid(ll x, ll y){
    x%=MOD;
    return x*power(y,MOD-2)%MOD;
}

int main(){
    int n; cin >> n;
    string s; cin >> s;
    ll sum=0;
    ll a=1, b=1;
    ll ac=0, bc=0;
    REP(i,n){
        int k=0;
        if(s[i]=='W')
            k=1;
        else if(s[i]=='R')
            k=2;
        if(ac<=bc)
            sum=(sum+k*divid(a,b))%3;
        if(i==n-1)
            break;
        ll x=n-1-i;
        while(x%3==0){
            x/=3;
            ac++;
        }
        a=a*x%3;
        ll y=i+1;
        while(y%3==0){
            y/=3;
            bc++;
        }
        b=b*y%3;
    }
    if(sum==0)
        cout << 'B' << endl;
    else if(n%2==0){
        if(sum==1)
            cout << 'R' << endl;
        else
            cout << 'W' << endl;
    }
    else{
        if(sum==1)
            cout << 'W' << endl;
        else
            cout << 'R' << endl;
    }
    return 0;
}