#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <climits>

#define rep(i, n) for(int i = 0; i < n; i++)
#define per(i, n) for(int i = n - 1; i >= 0; i--)
using ll = long long;
#define vi vector<int>
#define vvi vector<vi>
#define vl vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define mod 1000000007
using namespace std;
template<class T, class U>
T &chmax(T &a, const U &b){ if(a < b) a = b; return a; }
template<class T, class U>
T &chmin(T &a, const U &b){ if(a > b) a = b; return a; }
const int len = 400010;
vi f(len), g(len);
int main(){
  rep(i, len) g[i] = i % 3;
  int num = 3, cnt = 1;
  while(num < len){
    for(int i = 1; i * num < len; i++){
      f[i * num] = cnt;
      g[i * num] = i % 3;
    }
    cnt++;
    num *= 3;
  }
  g[0] = 1;
  //rep(i, 30) cout << g[i] << " ";
  for(int i = 1; i < len; i++){
    f[i] += f[i - 1];
    (g[i] *= g[i - 1]) %= 3;
  }

  int n;
  cin >> n;
  vector<char> c(n);
  int ans = 0;
  rep(i, n){
    cin >> c[i];
    //n-1 C i
    if(f[n - 1] != f[i] + f[n - i - 1]) continue;
    if(c[i] == 'B'){
      ans += 0 * g[n - 1] * g[i] * g[n - i - 1] % 3;
    }
    if(c[i] == 'W'){
      ans += 1 * g[n - 1] * g[i] * g[n - i - 1] % 3;
    }
    if(c[i] == 'R'){
      ans += 2 * g[n - 1] * g[i] * g[n - i - 1] % 3;
    }
    ans %= 3;
  }
  if(!(n & 1)) ans = (-ans + 3) % 3;
  if(ans == 0) cout << "B\n";
  if(ans == 1) cout << "W\n";
  if(ans == 2) cout << "R\n";
}
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long  int ll;
typedef long double db;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define pll pair<ll,ll>
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ub(v,val) upper_bound(v.begin(),v.end(),val)
#define np(str) next_permutation(str.begin(),str.end())
#define lb(v,val) lower_bound(v.begin(),v.end(),val)
#define sortv(vec) sort(vec.begin(),vec.end())
#define rev(p) reverse(p.begin(),p.end());
#define v vector
#define pi 3.14159265358979323846264338327950288419716939937510
#define len length()
#define repc(i,s,e) for(ll i=s;i<e;i++)
#define fi first
#define se second
#define mset(a,val) memset(a,val,sizeof(a));
#define mt make_tuple
#define repr(i,n) for(i=n-1;i>=0;i--)
#define rep(i,n) for(i=0;i<n;i++)
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define at(s,pos) *(s.find_by_order(pos))
#define set_ind(s,val) s.order_of_key(val)
long long int M = 1e9 + 7 ;
long long int inf = 9 * 1e18;
//CLOCK
ll begtime = clock();
#define time() cout << "\n\nTime elapsed: " << (clock() - begtime)*1000/CLOCKS_PER_SEC << " ms\n\n";
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//CLOCK ENDED
ll n, m;
// modular exponentiation
ll binpow(ll val, ll deg)
{
	if (deg < 0)
		return 0;
	if (!deg)
		return 1 % M;
	if (deg & 1)
		return binpow(val, deg - 1) * val % M;
	ll res = binpow(val, deg >> 1);
	return (res * res) % M;
}
//binomial
ll modinv(ll n) {
	return binpow(n, M - 2);
}


int main() {
	// your code goes here
	IOS;
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
	ll i, j, t, k, x, y, z,  N;
	cin >> x >> y >> z;
	z *= 1000;
	ll mn = 0, mx = 0;
	v<ll> vec;
	rep(i, 1000005) {
		mn += x;
		mx += y;
		if (z >= mn && z <= mx) {
			vec.pb(i + 1);
		}
	}
	if (vec.size() == 0) cout << "UNSATISFIABLE";
	else {
		cout << vec.front() << ' ' << vec.back();
	}



	return 0;




}










