//selem
#include <bits/stdc++.h>
//void IO() {freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);}
using namespace std;typedef long long ll;
#define all(x) begin(x), end(x)
#define pb push_back
typedef pair<ll,ll> pll;;typedef map<ll, ll> mll;
typedef vector<pll> vpll;
typedef vector<ll> vll;
int Arr[10000];vll adj[1000];
//finding root of an element.
int root(int Arr[ ],int i)
{
    while(Arr[ i ] != i)           //chase parent of current element until it reaches root.
    {
     i = Arr[ i ];
    }
    return i;
}

/*modified union function where we connect the elements by changing the root of one of the element */

int un(int Arr[ ] ,int A ,int B)
{
    int root_A = root(Arr, A);
    int root_B = root(Arr, B);
    Arr[ root_A ] = root_B ;       //setting parent of root(A) as root(B).
}
bool fnd(int A,int B)
{

    if( root(Arr, A)==root(Arr, B) )       //if A and B have same root,means they are connected.
    return true;
    else
    return false;
}
int main()
{
     ios_base::sync_with_stdio(false);cin.tie(NULL);



        double f;cin>>f;
        double ff;cin>>ff;
        cout<<(f/100.0)*ff;
        return 0;
}

#line 1 "main.cpp"
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; (i) < (int)(n); ++ (i))
#define rep3(i, m, n) for (int i = (m); (i) < (int)(n); ++ (i))
#define repr(i, n) for (int i = (int)(n) - 1; (i) >= 0; -- (i))
#define rep3r(i, m, n) for (int i = (int)(n) - 1; (i) >= (int)(m); -- (i))
#define ALL(x) std::begin(x), std::end(x)
using namespace std;

long long bf[1 << 19];
long long bg[1 << 19];
void init() {
	for (int i = 1; i <= 400000; i++) {
		int pos = i;
		while (pos % 3 == 0) { pos /= 3; bf[i] += 1; }
		bg[i] = pos % 3;
	}
	bg[0] = 1;
	for (int i = 1; i <= 400000; i++) bf[i] += bf[i - 1];
	for (int i = 1; i <= 400000; i++) bg[i] = (bg[i] * bg[i - 1]) % 3;
}
int ncr_mod_3(int n, int r) {
	if (bf[n] != bf[r] + bf[n - r]) return 0;
	if (bg[n] == 1 && bg[r] * bg[n - r] == 1) return 1;
	if (bg[n] == 1 && bg[r] * bg[n - r] == 2) return 2;
	if (bg[n] == 1 && bg[r] * bg[n - r] == 4) return 1;
	if (bg[n] == 2 && bg[r] * bg[n - r] == 1) return 2;
	if (bg[n] == 2 && bg[r] * bg[n - r] == 2) return 1;
	if (bg[n] == 2 && bg[r] * bg[n - r] == 4) return 2;
	return -1;
}

map<char, int> c2d;
map<char, int> d2c;

int main() {
    c2d['B'] = 0;
    c2d['W'] = 1;
    c2d['R'] = 2;
    d2c[0] = 'B';
    d2c[1] = 'W';
    d2c[2] = 'R';
    int n; cin >> n;
    string s; cin >> s;
    int ans = 0;
    init();
    rep(i, n) {
        int v = c2d[s[i]];
        // cerr << i << " " << ncr_mod_3(n-1,i)  << " " << v << endl;
        ans += ncr_mod_3(n-1,i)*v;
        ans %= 3;
    }
    if (n % 2 == 0) ans *= 2;
    ans %= 3;
    // cerr << ans << endl;
    cout << (char)d2c[ans] << endl;

    return 0;
}
