#include <bits/stdc++.h>
using namespace std;
const int INF=1e9;
using pii=pair<int,int>;
using tii=tuple<int,int,int>;
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
template<class T> void chmin(T &a,T b){
    if(a>b){
        a=b;
    }
}
template<class T> void chmax(T &a,T b){
    if(a<b){
        a=b;
    }
}
int H=60,W=25;
struct Input{
    int n;
    vector<int> h,p,x;
    void input_cin(){
        cin >> n;
        if(n==-1) exit(0);
        h.assign(n,0);
        p.assign(n,0);
        x.assign(n,0);
        rep(i,n) cin >> h[i] >> p[i] >> x[i];
    }
}Input;
struct solver{
    struct shooter{
        int j;
        int l;
        int s;
    };
    struct enemy{
        int fh;
        int h;
        int p;
    };
    void solve(){
        int score=0;
        shooter me={12,1,0};
        vector<vector<enemy>> grid(H,vector<enemy>(W,{0,0,0}));
        int to=-1; 
        rep(t,1000){
            for(int i=H-2;0<=i;i--){
                rep(j,W){
                    grid[i+1][j]=grid[i][j];
                    grid[i][j]={0,0,0};
                }
            }
            Input.input_cin();
            rep(i,Input.n){
                grid[0][Input.x[i]].fh=Input.h[i];
                grid[0][Input.x[i]].h=Input.h[i];
                grid[0][Input.x[i]].p=Input.p[i];
            }
            if(1<=me.l){
                if(to==-1){
                    double mx=0;
                    int p=-1;
                    rep(i,H){
                        rep(j,W){
                            if(0<grid[i][j].h){
                                if(grid[i][j].h-(H-1-i-abs(me.j-j))*me.l<=0){
                                    bool ok=true;
                                    for(int k=1;k<abs(me.j-j);k++){
                                        if(me.j<j){
                                            if(0<grid[H-1-k][me.j+k].h) ok=false;
                                            //if(0<grid[H-1-k+1][me.j+k].h) ok=false;
                                        }else{
                                            if(0<grid[H-1-k][me.j-k].h) ok=false;
                                            //if(0<grid[H-1-k+1][me.j-k].h) ok=false;
                                        }
                                    }
                                    for(int k=i+1;k<H;k++){
                                        if(0<grid[k][j].h) ok=false;
                                    }
                                    if(!ok) continue;
                                    double now=(double)grid[i][j].fh/(double)(abs(me.j-j)+(grid[i][j].h+me.l-1)/me.l);
                                    if(mx<now){
                                        mx=now;
                                        p=j;
                                    }
                                }
                            }
                        }
                    }
                    to=p;
                }
                if(to==-1){
                    cout << "S" << endl;
                }else if(to<me.j){
                    cout << "L" << endl;
                    me.j--;
                }else if(me.j<to){
                    cout << "R" << endl;
                    me.j++;
                }else{
                    cout << "S" << endl;
                }
            }else if(0<grid[H-2][me.j].h){
                if(0<=me.j-1&&grid[H-2][me.j-1].h==0){
                    cout << "L" << endl;
                    me.j--;
                }else if(me.j+1<W&&grid[H-2][me.j+1].h==0){
                    cout << "R" << endl;
                    me.j++;
                }else{
                    cout << "S" << endl;
                }
            }else{
                cout << "S" << endl;
            }
            for(int i=H-2;0<=i;i--){
                if(0<grid[i][me.j].h){
                    grid[i][me.j].h-=me.l;
                    if(grid[i][me.j].h<=0){
                        score+=grid[i][me.j].fh;
                        grid[i][me.j].fh=0;
                        grid[i][me.j].h=0;
                        me.s+=grid[i][me.j].p;
                        grid[i][me.j].p=0;
                        if(me.j==to) to=-1;
                    }
                    break;
                }
            }
            me.l=1+me.s/100;
        }
    }
}Solver;
int main(){
    //提出時消す
    rep(i,25){
        int p;
        cin >> p;
    }
    Solver.solve();
}