#include <bits/stdc++.h>
using namespace std;
const string no = "NO", yes = "YES";
const long long inf = 1e18;
const int mod = 1e9 + 7;
const long double pi = acosl(-1.0);
bool isPrime[100005];
long long fact[100005];
bool sbs(const pair<long long, long long> &a,
         const pair<long long, long long> b) {
  return a.second > b.second;
}
void seive() {
  memset(isPrime, true, sizeof(isPrime));
  isPrime[1] = false;
  isPrime[2] = false;
  for (int i = 2; i * i <= 100005; i++) {
    for (int j = i * i; j <= 100005; j += i) {
      isPrime[j] = false;
    }
  }
}
void factorial() {
  fact[0] = fact[1] = 1;
  for (int i = 2; i < 100005; i++)
    fact[i] = (fact[i - 1] % mod * i % mod) % mod;
}
long long power(long long x, int y, int p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long modInverse(long long n, int p) { return power(n, p - 2, p); }
long long nCrModPFermat(long long n, int r, int p) {
  if (n < r) return 0;
  if (r == 0) return 1;
  long long fac[n + 1];
  fac[0] = 1;
  for (int i = 1; i <= n; i++) fac[i] = (fac[i - 1] * i) % p;
  return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) %
         p;
}
void boobs() {
  string s;
  cin >> s;
  bool flag = true;
  for (int i = 0; i < s.size(); i++) {
    if (s[i] != s[s.size() - 1 - i]) {
      flag = false;
      break;
    }
  }
  if (flag) {
    cout << 0 << '\n';
    return;
  }
  cout << 4 << '\n';
  int n = s.size();
  cout << "L " << s.size() - 1 << '\n';
  n += s.size() - 2;
  cout << "L 2\n";
  n++;
  cout << "R 2\n";
  n += n - 2;
  cout << "R " << n - 1 << '\n';
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int t = 1;
  while (t--) boobs();
}
