#include "toxic.h"
#include <bits/stdc++.h>

void determine_type(int n) {
  int x, s;
  std::vector<char> ans(1000, 'R');
  {
    std::vector<int> p(1000);
    for (int i = 1; i < 500; i++) {
      p[i + 500] = i;
    }
    auto a = query_machine(p);
    if (a.back() < 1000) {
      if (a.back() > 500) {
        x = 0;
      } else {
        x = a.size() - 500;
      }
      s = 0;
    } else {
      for (int i = 1; i < 500; i++) {
        p[i + 500] = i + 499;
      }
      auto b = query_machine(p);
      if (b.back() == 1000) {
        if (query_machine({0, 999, 999}).back() == 1) {
          for (int i = 0; i < 999; i++) {
            ans[i] = 'T';
          }
        } else {
          ans[999] = 'T';
        }
        s = 1000;
      } else {
        if (b.back() > 500) {
          x = 0;
          for (int i = 0; i < 500; i++) {
            ans[i] = 'T';
          }
        } else {
          x = b.size() - 1;
        }
        s = 500;
      }
    }
  }

  std::vector<std::array<int, 2>> pr;
  for (int i = 0; i < 20; i++) {
    for (int j = 0; j <= 5; j++) {
      if ((i * 2 + 3) * (1 << j) <= 36) {
        pr.push_back({i, j});
      }
    }
  }

  for (int i = s; i < 1000; i += 50) {
    std::vector<int> a(50);
    for (int j = 0; j < 50; j++) {
      a[j] = std::min(999, i + j);
    }
    std::vector<int> qry;
    for (int j = 0; j < 19; j++) {
      qry.push_back(a[48]);
    }
    for (int j = 0; j < 18; j++) {
      qry.push_back(x);
      for (int k = 0; k < j * 2 + 1; k++) {
        qry.push_back(a[j]);
      }
    }
    for (int j = 0; j < 30; j++) {
      auto [w, h] = pr[j];
      for (int A = 0; A < 1 << h; A++) {
        qry.push_back(x);
        for (int B = 0; B < w * 2 + 2; B++) {
          qry.push_back(a[j + 18]);
        }
      }
    }
    qry.push_back(x);
    for (int j = 0; j < 20; j++) {
      qry.push_back(a[49]);
    }

    auto t = query_machine(qry);
    int reg = 0;
    if (t.size() == 19) {
      ans[a[49]] = 'T';
      reg = 1;
    } else if (t.size() == 20) {
      if (t[17] - t[18] == 1) {
        ans[a[48]] = 'T';
        reg = 1;
      } else {
        reg = 2;
      }
    } else {
      ans[a[48]] = ans[a[49]] = 'T';
    }

    int par = 1;
    for (int j = 0; j < 18; j++) {
      if (j < t.size()) {
        if ((par - t[j] + reg) % 2 == 0) {
          ans[a[j]] = 'T';
        }
        par = t[j] % 2;
      } else {
        ans[a[j]] = 'T';
      }
    }

    for (int j = 16; j >= 0; j--) {
      if (j >= t.size()) {
        for (int k = 0; k < 30; k++) {
          if (pr[k][0] == j) {
            ans[a[k + 18]] = 'T';
          }
        }
      } else {
        int T = (j == 0 ? qry.size() : t[j - 1]) - t[j];
        T -= reg;
        if (ans[a[j]] == 'R') {
          T--;
        }
        for (int k = j + 1; k < 18; k++) {
          if (ans[a[k]] == 'R') {
            T -= 2;
          }
        }
        for (int k = 0; k < 30; k++) {
          if (ans[a[k + 18]] == 'R' && pr[k][0] > j) {
            T -= 1 << pr[k][1] + 1;
          }
        }
        for (int k = 0; k < 30; k++) {
          if (pr[k][0] == j && !(T >> pr[k][1] + 1 & 1)) {
            ans[a[k + 18]] = 'T';
          }
        }
      }
    }
  }

  answer_type(ans);
}