#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;
        string root;
        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(to==-1){
                double mx=0;
                int p=-1;
                string mx_root;
                rep(i,H){
                    rep(j,W){
                        if(0<grid[i][j].h){
                            bool ok=true;
                            for(int k=i+1;k<H;k++){
                                if(0<grid[k][j].h) ok=false;
                            }
                            if(!ok) continue;
                            int n=H-i,z=abs(j-me.j);
                            vector<vector<pii>> dp(n+1,vector<pii>(z+1,{-1,-1}));
                            dp[0][0]={-2,-2};
                            rep(ii,n){
                                rep(jj,z+1){
                                    if(dp[ii][jj]==pair<int,int>({-1,-1})) continue;
                                    dp[ii+1][jj]={ii,jj};
                                    if(z<jj+1) continue;
                                    if(me.j<j){
                                        if(0<=H-1-ii&&H-1-ii<H&&0<=H-1-(ii+1)&&H-1-(ii+1)<H&&grid[H-1-ii][me.j+jj].h==0&&grid[H-1-(ii+1)][me.j+jj].h==0) dp[ii+1][jj+1]={ii,jj};
                                    }else{
                                        if(0<=H-1-ii&&H-1-ii<H&&0<=H-1-(ii+1)&&H-1-(ii+1)<H&&grid[H-1-ii][me.j-jj].h==0&&grid[H-1-(ii+1)][me.j-jj].h==0) dp[ii+1][jj+1]={ii,jj};
                                    }
                                }
                            }
                            int t=-1;
                            pii pa={-1,-1};
                            rep(ii,n+1){
                                if(dp[ii][z]!=pair<int,int>({-1,-1})){
                                    t=ii;
                                    pa={ii,z};
                                    break;
                                }
                            }
                            if(t==-1||0<grid[i][j].h-(H-1-i-t)*me.l) continue;
                            double now=(double)grid[i][j].fh/(double)(t+(grid[i][j].h+me.l-1)/me.l);
                            if(mx<now){
                                mx=now;
                                p=j;
                                mx_root="";
                                while(pa!=pair<int,int>({0,0})){
                                    pii new_pa=dp[pa.first][pa.second];
                                    if(new_pa.second!=pa.second){
                                        if(me.j<j) mx_root.push_back('R');
                                        else mx_root.push_back('L');
                                    }else{
                                        mx_root.push_back('S');
                                    }
                                    pa=new_pa;
                                }
                            }
                        }
                    }
                }
                to=p;
                root=mx_root;
            }
            if(to==-1){
                cout << "S" << endl;
            }else if(!root.empty()){
                cout << root.back() << endl;
                if(root.back()=='L') me.j--;
                if(root.back()=='R') me.j++;
                root.pop_back();
            }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();
}