#include <bits/stdc++.h>
using namespace std;
using pi = pair<int, int>;
using pl = pair<long long, long long>;
using vi = vector<int>;
using vl = vector<long long>;
using vb = vector<bool>;
using vd = vector<double>;
using vc = vector<char>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<long long>>;
using vvb = vector<vector<bool>>;
using vvd = vector<vector<double>>;
using vvc = vector<vector<char>>;
using vvpi = vector<vector<pi>>;
using vvpl = vector<vector<pl>>;
using vvvi = vector<vector<vector<int>>>;
using vvvl = vector<vector<vector<long long>>>;
using vvvb = vector<vector<vector<bool>>>;
using vvvd = vector<vector<vector<double>>>;
using vvvc = vector<vector<vector<char>>>;
using vvvpi = vector<vector<vector<pi>>>;
using vvvpl = vector<vector<vector<pl>>>;
const int mxN = 8e5 + 100;
const long long MOD = 1e9 + 7;
void fast() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
vl factorial;
long long expo(long long x, long long exp) {
  if (exp <= 0) return 1;
  long long tmp = (x * x) % MOD;
  if (exp % 2) {
    return (expo(tmp, exp / 2) * x) % MOD;
  }
  return (expo(tmp, exp / 2)) % MOD;
}
long long choice(long long n, long long r) {
  if (n < r) return 0;
  long long numer = factorial[n];
  long long denom = (factorial[r] * factorial[n - r]) % MOD;
  return numer * expo(denom, MOD - 2) % MOD;
}
int main() {
  fast();
  string s;
  cin >> s;
  int n = s.size();
  cout << 8 << "\n";
  cout << "L 2\nL 2\n";
  n += 2;
  cout << "R 2\nL " << 4 << "\nL 2\nR ";
  n += (n - 2);
  n += 4;
  cout << n - 1 << "\n";
  ++n;
  cout << "R 2\n";
  n += (n - 2);
  cout << "R " << n - 1 << "\n";
}
