#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
long long int gcd(long long int A, long long int B) {
  if (!B) return A;
  return gcd(B, A % B);
}
int main() {
  string s;
  cin >> s;
  int n = s.length();
  cout << 3 << '\n';
  cout << "L"
       << " " << 2 << '\n';
  cout << "R"
       << " " << 2 << '\n';
  cout << "R"
       << " " << 2 * n - 1 << '\n';
}
