#include <bits/stdc++.h>
using namespace std;
void accept_arr(int n, int arr[]);
int anagram_pairs(string s);
string alphabetize(string s);
bool is_after(int month1, int day1, int year1, int month2, int day2, int year2);
long long convert_to_long(string s, long long mod);
long long p_mod(long long a, long long b);
int main() {
  string s;
  cin >> s;
  int n = s.length();
  cout << 3 << endl;
  cout << "L 2" << endl;
  cout << "R 2" << endl;
  cout << "R " << (2 * n - 1) << endl;
  return 0;
}
void accept_arr(int n, int arr[]) {
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
}
int anagram_pairs(string s) {
  map<string, int> substrs;
  for (int i = 0; i < s.length(); i++) {
    for (int n = 1; n <= s.length() - i; n++) {
      substrs[alphabetize(s.substr(i, n))]++;
    }
  }
  int anagrams = 0;
  map<string, int>::iterator it;
  for (it = substrs.begin(); it != substrs.end(); it++) {
    int substr_count = it->second;
    if (substr_count > 1) {
      anagrams += ((substr_count - 1) * substr_count) / 2;
    }
  }
  return anagrams;
}
string alphabetize(string s) {
  char counts[26];
  fill(counts, counts + 26, 0);
  for (int i = 0; i < s.length(); i++) {
    counts[s[i] - 'a']++;
  }
  string alpha_s = "";
  for (int i = 0; i < 26; i++) {
    for (int j = 0; j < counts[i]; j++) {
      alpha_s += (char)('a' + i);
    }
  }
  return alpha_s;
}
bool is_after(int month1, int day1, int year1, int month2, int day2,
              int year2) {
  if (year1 > year2) {
    return true;
  }
  if (year1 < year2) {
    return false;
  }
  if (month1 > month2) {
    return true;
  }
  if (month1 < month2) {
    return false;
  }
  return day1 > day2;
}
long long convert_to_long(string s, long long mod) {
  long long num = 0;
  for (int i = 0; i < s.length(); i++) {
    num *= 10;
    num += (long long)(s[i] - '0');
    num %= mod;
  }
  return num;
}
long long p_mod(long long a, long long b) {
  long long mod = a % b;
  return mod < 0 ? mod + abs(b) : mod;
}
