#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
const int MOD = 1000000007;
bool ispalindrome(string &s) {
  for (int i = 0; i < (int)s.size() / 2; i++) {
    if (s[i] == s[(s.size() - i - 1)])
      continue;
    else
      return false;
  }
  return 1;
}
int main(int argc, char *argv[]) {
  string s;
  cin >> s;
  if (ispalindrome(s)) {
    cout << 0 << '\n';
  } else {
    cout << 3 << '\n';
    cout << 'R' << " " << s.size() - 1 << '\n';
    cout << 'L' << " " << s.size() << '\n';
    cout << 'L' << " " << 2 << '\n';
  }
}
