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

typedef long long int ll;

vector<vector<int>> swapper;

int turnTableLX[3][3]={{0,0,0},{1,0,-1},{0,0,0}};
int turnTableLY[3][3]={{0,-1,0},{0,0,0},{0,1,0}};

int vx=0,vy=1;
int px=0,py=0;
bool target=false;
int tx,ty;
map<pair<int,int>,int> field;

void print(){
    int x,y;
    for (y=-3;y<3;y++){
        for (x=-3;x<3;x++){
            pair<int,int> p=make_pair(x,y);
            if (px==x&&py==y) cout<<"[";else cout<<" ";
            if (field.count(p)){
                cout << field[p];
            }else{
                cout << "?";
            }

            if (px==x&&py==y) cout<<"]";else cout<<" ";
        }
        cout<<endl;
    }
}

inline bool moveable(int x,int y){
    pair<int,int> p=make_pair(x,y);
    return field.count(p) && field[p];
}

inline void turnLeft(){
    int x=vx,y=vy;
    vx=turnTableLX[x+1][y+1];
    vy=turnTableLY[x+1][y+1];
}
inline void turnRight(){
    int x=vx,y=vy;
    vx=-turnTableLX[x+1][y+1];
    vy=-turnTableLY[x+1][y+1];
}

inline bool isKnown(int x,int y){
    return field.count(make_pair(x+1,y)) 
        && field.count(make_pair(x-1,y)) 
        && field.count(make_pair(x,y+1)) 
        && field.count(make_pair(x,y-1)) ;
}

void finalAction(){
    int l;
    do{
        puts("F\n");
    }while(scanf("%d",&l)>0);
    exit(0);
}

void check(){
    int l,i;
    if (scanf("%d",&l)<=0) exit(0);
    if (l==20151224) finalAction();
    for (i=1;i<=l;i++){
        field[make_pair(px+vx*i,py+vy*i)]=1;
    }
    field[make_pair(px+vx*i,py+vy*i)]=0;
}

void action(){
    int b;
    if (target){
        // 使ってない
    }else{
        if (isKnown(px,py)){
            map<pair<int,int>,bool> dp;
            queue<vector<int>> q;
            if (moveable(px-1,py)) q.push(vector<int>{px-1,py,-1,0});
            if (moveable(px+1,py)) q.push(vector<int>{px+1,py,1,0});
            if (moveable(px,py-1)) q.push(vector<int>{px,py-1,0,-1});
            if (moveable(px,py+1)) q.push(vector<int>{px,py+1,0,1});
            while (!q.empty()){
                vector<int> &v=q.front();
                dp[make_pair(v[0],v[1])]=true;
                if (isKnown(v[0],v[1])){
                    if (!dp.count(make_pair(v[0]+1,v[1]))
                        && moveable(v[0]+1,v[1])) q.push(vector<int>{v[0]+1,v[1],v[2],v[3]});
                    if (!dp.count(make_pair(v[0]-1,v[1]))
                        && moveable(v[0]-1,v[1])) q.push(vector<int>{v[0]-1,v[1],v[2],v[3]});
                    if (!dp.count(make_pair(v[0],v[1]+1))
                        && moveable(v[0],v[1]+1)) q.push(vector<int>{v[0],v[1]+1,v[2],v[3]});
                    if (!dp.count(make_pair(v[0],v[1]-1))
                        && moveable(v[0],v[1]-1)) q.push(vector<int>{v[0],v[1]-1,v[2],v[3]});
                }else{
                    // target=true;
                    // tx=v[0];ty=v[1];
                    // action();
                    if (v[2]==vx && v[3]==vy){
                        puts("F\n");
                        px+=vx;py+=vy;
                    }else{
                        if (turnTableLX[vx+1][vy+1]==v[2] && turnTableLX[vx+1][vy+1]==v[3]){
                            puts("R\n");
                            turnLeft();
                        }else{
                            puts("L\n");
                            turnRight();
                        }
                    }
                    break;
                }
                q.pop();
            }
        }else{
            puts("R\n");
            turnLeft();
        }
    }
}

int main(){
    int i,j,k,l,m,n,h,x,y;

    field[make_pair(0,0)]=1;
    
    while (true){
        check();
        action();
        //print();
    }
    
    return 0;
}