#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")

#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
set<pl> st;
ll x=0,y=0;
ll dir=0;
pl nxt(){
    return make_pair(x+dx[dir],y+dy[dir]);
}
pl prev(){
    return make_pair(x-dx[dir],y-dy[dir]);
}
bool solve(){
    st.insert(make_pair(x,y));
    string s;cin >> s;
    if(s[0]=='M')return false;
    ll p=stoll(s);
    string hoge;
    if(p&&(!st.count(nxt()))){
        cout << 'F' << endl;
        tie(x,y)=nxt();
        auto f=solve();
        if(!f)return false;
        cout << 'B' << endl;
        tie(x,y)=prev();
        cin >> hoge;
    }
    cout << 'R' << endl;dir=(dir+1)%4;
    cin >> s;p=stoll(s);
    if(p&&(!st.count(nxt()))){
        cout << 'F' << endl;
        tie(x,y)=nxt();
        auto f=solve();
        if(!f)return false;
        cout << 'B' << endl;
        tie(x,y)=prev();
        cin >> hoge;
    }
    cout << 'L' << endl;dir=(dir+3)%4;cin >> hoge;
    cout << 'L' << endl;dir=(dir+3)%4;cin >> s;p=stoll(s);
    /*if(p==200){
        cout << st.count(nxt()) << endl;
    }*/
    if(p&&(!st.count(nxt()))){
        cout << 'F' << endl;
        tie(x,y)=nxt();
        auto f=solve();
        if(!f)return false;
        cout << 'B' << endl;
        tie(x,y)=prev();
        cin >> hoge;
    }
    cout << 'R' << endl;dir=(dir+1)%4;cin >> hoge;
    return true;
}
int main(){
    solve();
}