#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

void myout(const char *s) {
	puts(s); fflush(stdout);
}

set<pii> vis;
bool dfs(int i, int j, int d0) {
	if(vis.count(mp(i, j))) return false;
	vis.insert(mp(i, j));
	static const int dy[4] = {0, 1, 0, -1}, dx[4] = {1, 0, -1, 0};
	int nextds[4]; int k = 0;
	rep(di, 4) {
		int d = (d0 + di) % 4;
		int yy = i + dy[d], xx = j + dx[d];
		int t;
		if(scanf("%d", &t) == 0) return true;
		if(t > 0)
			nextds[k ++] = d;
		myout("R");
	}
	rep(kk, k) {
		int d = nextds[kk];
		int p = d0; 
		while(p != d) myout("R"), (++ p) %= 4;
		myout("F");
		if(dfs(i + dy[d], j + dx[d], d))
			return true;
		myout("B");
		while(p != d0) myout("R"), (++ p) %= 4;
	}
	return false;
}

int main() {
	bool ok = dfs(0, 0, 0);
	if(!ok) return -1;
	return 0;
}