#include <bits/stdc++.h>
using namespace std;
long long int modulo_add(long long int a, long long int b,
                         long long int m = 1000000007) {
  long long int x;
  x = ((a % 1000000007) + (b % 1000000007)) % 1000000007;
  return x;
}
long long int modulo_mul(long long int a, long long int b,
                         long long int m = 1000000007) {
  long long int x;
  x = ((a % 1000000007) * (b % 1000000007)) % 1000000007;
  return x;
}
template <typename T1, typename T2>
inline bool compare(T1 &element1, T2 &element2) {
  if (is_same<T1, long long int>::value) {
    cout << "LONG LONG INT" << endl;
  }
  if (is_same<T1, pair<pair<long long int, long long int>,
                       long long int> >::value) {
    return element1.first.second < element2.first.second;
  }
  return (element1 > element2);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long int t;
  t = 1;
  while (t--) {
    double check;
    char alpha;
    long long int i, j, k, temp, m, n, res = 0, flag = 0, a, b, val, total = 0,
                                       size, size1, q, c, d, position, x, y;
    string data;
    cin >> data;
    n = data.size();
    cout << 3 << endl;
    cout << "L 2" << endl;
    cout << "R 2" << endl;
    total = 2 * n;
    cout << "R " << total - 1 << endl;
  }
  return 0;
}
