#include "toxic.h"
#include <bits/stdc++.h>
#define ask query_machine
#define sz(a) ((int)(a).size())
using namespace std;
void determine_type(int n) 
{
    vector<char> ans(n); int m = (n / 2), t = -1;
    auto solve = [&](int l) 
    {
        vector<int> a; l--;
        for(int i = 1; i <= 19; i++) a.push_back(l + 49);
        for(int i = 1; i <= 36; i++) 
        {
            a.push_back(t); 
            for(int j = 1; j <= i; j++) a.push_back(l + i);
        }
        for(int i = 1; i <= 8; i++) 
        {
            for(int o = 0; o < 2; o++) 
            {
                a.push_back(t);
                for(int j = 1; j <= (i + i); j++) a.push_back(l + 36 + i);
            }
        }
        for(int i = 1; i <= 4; i++)
        {
            for(int o = 0; o < 4; o++)
            {
                a.push_back(t);
                for(int j = 1; j <= (i + i); j++) a.push_back(l + 44 + i);
            }
        }
        a.push_back(t);
        for(int i = 1; i <= 20; i++) a.push_back(l + 50);
        auto b = ask(a);
        while(sz(b) < 20) b.push_back(b.back());
        b.insert(begin(b), sz(a)); int s = 0;
        for(int i = 20; i >= 1; i--) 
        {
            int u = b[i - 1] - b[i] - s;
            if(i == 20) 
            { 
                assert(u >= 0 && u < 2);
                if(u) ans[l + 50] = 'R', s++;
                else ans[l + 50] = 'T';
            }
            if(i == 19) 
            {
                assert(u >= 0 && u < 2);
                if(u) ans[l + 49] = 'R', s++;
                else ans[l + 49] = 'T';
            }
            if(i >= 9 && i <= 18) 
            {
                assert(u >= 0 && u < 4);
                if(u & 2) ans[l + i + i] = 'R', s += 2;
                else ans[l + i + i] = 'T';
                if(u & 1) ans[l + i + i - 1] = 'R', s += 2;
                else ans[l + i + i - 1] = 'T';  
            }
            if(i >= 5 && i <= 8)
            {
                assert(u >= 0 && u < 8);
                if(u & 4) ans[l + 36 + i] = 'R', s += 4;
                else ans[l + 36 + i] = 'T';
                if(u & 2) ans[l + i + i] = 'R', s += 2;
                else ans[l + i + i] = 'T';
                if(u & 1) ans[l + i + i - 1] = 'R', s += 2;
                else ans[l + i + i - 1] = 'T';  
            }
            if(i >= 1 && i <= 4) 
            {
                assert(u >= 0 && u < 16);
                if(u & 8) ans[l + 44 + i] = 'R', s += 8;
                else ans[l + 44 + i] = 'T';
                if(u & 4) ans[l + 36 + i] = 'R', s += 4;
                else ans[l + 36 + i] = 'T';
                if(u & 2) ans[l + i + i] = 'R', s += 2;
                else ans[l + i + i] = 'T';
                if(u & 1) ans[l + i + i - 1] = 'R', s += 2;
                else ans[l + i + i - 1] = 'T';  
            }
        }
        for(int i = 1; i <= 50; i++) assert(ans[i + l] == 'T' || ans[i + l] == 'R');
    };
    vector<int> a(n); 
    for(int i = 1; i < m; i++) a[i + m] = i;
    auto b = ask(a);
    if(b.back() != n) 
    {
        if(b.back() >= m) t = 0;
        else t = sz(b) - m;
        for(int i = 0; i < n; i += 50) solve(i);
    }
    else 
    {
        for(int i = 0; i < n; i++) a[i] += m;
        auto c = ask(a);
        if(c.back() == n) 
        {
            auto d = ask(vector<int> {m - 1, m - 1, m});
            ans[m - 1] = (d.back() == 2 ? 'T' : 'R'); ans[m] = (d.back() == 1 ? 'T' : 'R');
            for(int i = 1; i < m; i++) ans[m + i] = ans[m], ans[m - 1 - i] = ans[m - 1];
        }
        else 
        {
            if(c.back() >= m) t = m;
            else t = sz(c);
            auto d = ask(vector<int> {m - 1, t}); ans[m - 1] = (d.back() == 2 ? 'T' : 'R'); 
            for(int i = 0; i < m - 1; i++) ans[i] = ans[m - 1];
            for(int i = m; i < n; i += 50) solve(i);
        }
    }
    answer_type(ans);
}