#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int N = 2000005;
bool Palindrome(string s) {
  int n = s.length();
  for (int i = 0; i < n / 2; i++) {
    if (s[i] != s[n - i - 1]) {
      return false;
    }
  }
  return true;
}
int32_t main() {
  int t = 1;
  while (t--) {
    string s;
    cin >> s;
    int n = s.length();
    cout << "3"
         << "\n";
    cout << "R " << n - 1 << "\n";
    n += 1;
    cout << "L " << n - 1 << "\n";
    n += (n - 2);
    cout << "L 2"
         << "\n";
  }
  return 0;
}
