Problem: Ringo found a string s of length n in his [yellow submarine](https://www.youtube.com/watch?v=m2uTFF_3MaA). The string contains only lowercase letters from the English alphabet. As Ringo and his friends love palindromes, he would like to turn the string s into a palindrome by applying two types of operations to the string. 

The first operation allows him to choose i (2 ≤ i ≤ n-1) and to append the substring s_2s_3 … s_i (i - 1 characters) reversed to the front of s.

The second operation allows him to choose i (2 ≤ i ≤ n-1) and to append the substring s_i s_{i + 1}… s_{n - 1} (n - i characters) reversed to the end of s.

Note that characters in the string in this problem are indexed from 1.

For example suppose s=abcdef. If he performs the first operation with i=3 then he appends cb to the front of s and the result will be cbabcdef. Performing the second operation on the resulted string with i=5 will yield cbabcdefedc.

Your task is to help Ringo make the entire string a palindrome by applying any of the two operations (in total) at most 30 times. The length of the resulting palindrome must not exceed 10^6

It is guaranteed that under these constraints there always is a solution. Also note you do not have to minimize neither the number of operations applied, nor the length of the resulting string, but they have to fit into the constraints.

Input

The only line contains the string S (3 ≤ |s| ≤ 10^5) of lowercase letters from the English alphabet.

Output

The first line should contain k (0≤ k ≤ 30) — the number of operations performed.

Each of the following k lines should describe an operation in form L i or R i. L represents the first operation, R represents the second operation, i represents the index chosen.

The length of the resulting palindrome must not exceed 10^6.

Examples

Input


abac


Output


2
R 2
R 5


Input


acccc


Output


2
L 4
L 2


Input


hannah


Output


0

Note

For the first example the following operations are performed:

abac → abacab → abacaba

The second sample performs the following operations: acccc → cccacccc → ccccacccc

The third example is already a palindrome so no operations are required.

Solution (in JAVA):

Solution:
											import java.math.BigInteger;
											import java.sql.Array;
										    import java.util.ArrayList;
											import java.util.Arrays;
											import java.util.Collection;
											import java.util.Collections;
											import java.util.Comparator;
											import java.util.HashMap;
import java.util.HashSet;
import java.util.InputMismatchException;
											import java.util.Iterator;
											import java.util.LinkedHashSet;
											import java.util.LinkedList;
											import java.util.List;
											import java.util.Map;
											import java.util.Map.Entry;	
											import java.util.PriorityQueue;
											import java.util.Queue;
											import java.util.Scanner;
											import java.util.Set;
											import java.util.Stack;
											import java.io.BufferedReader;
											import java.io.IOException;
											import java.io.InputStream;
											import java.io.InputStreamReader;
											import java.util.Scanner;
											import java.util.StringTokenizer;
											import java.util.TreeMap;
											import java.util.TreeSet;
											
											
											
											public class Main {
												
											static long l[];	
											static int k;	
													static int cycle=0;
												static InputReader rd=new InputReader(System.in);
											
												public static void main(String[] args) {
													Scanner sc=new Scanner(System.in);
													
													
												
													
														
														
															
															String s=sc.next();
															
															System.out.println(3);
															System.out.println("R"+" "+2);
															System.out.println("L"+" "+s.length());
															System.out.println("L"+" "+(s.length()-1));
															
															
															
															
															
															
												
												
													
												}
												static void findCycle(ArrayList<Integer> adj[],int v,int visited[],boolean visitedc[]) {
													
													
													visited[v]=1;
													visitedc[v]=true;
													
													
													for(int i:adj[v]) {
														 if(visited[i]==1) { 
																//System.out.println("cy "+i);
																cycle++;}
															
														if(visited[i]==0)findCycle(adj, i, visited,visitedc);
													}
													
													visited[v]=2;
												}
												
												
												static class post{
													
													int pos;int min;int max;
													public post(int min,int max) {
														
														
														this.min=min;
														this.max=max;
														// TODO Auto-generated constructor stub
													}
													
													
												}
												
												
												
												
												static long gcd(long a, long b) 
												{ 
												    if (a == 0) 
												        return b; 
												    return gcd(b % a, a); 
												} 
												  
												// Function to print all the 
												// common divisors 
												static int printAllDivisors(long arr[], int N) 
												{ 
												    // Variable to find the gcd 
												    // of N numbers 
												    long g = arr[0]; 
												  
												    // Set to store all the 
												    // common divisors 
												    HashSet<Long> divisors = new HashSet<Long>(); 
												  
												    // Finding GCD of the given 
												    // N numbers 
												    for (int i = 1; i < N; i++)  
												    { 
												        g = gcd(arr[i], g); 
												    } 
												  
												    // Finding divisors of the 
												    // HCF of n numbers 
												    for (long i = 1; i * i <= g; i++) 
												    { 
												        if (g % i == 0)  
												        { 
												            divisors.add(i); 
												            if (g / i != i) 
												                divisors.add(g / i); 
												        } 
												    } 
												  
												    // Print all the divisors 
												
												    return divisors.size();
												} 
												
												
												
												
												
												
												
												
												
												
												static class Node{
													
													int p;int c;
													
													public Node(int p,int c) {
														// TODO Auto-generated constructor stub
													
														this.p=p;
														this.c=c;
															
													}
													
													
													
													
													
													
												}
												
												
												
												
												
												
												static class delivery{
													
													
													
													long a;long b;
													public delivery(long a, long b) {
														
														
														this.a=a;
														this.b=b;
														// TODO Auto-generated constructor stub
													}
													
													
												}
															
												public static int removeDuplicateElementsFromArray(int array[], int arrayLength){
											        //Checking the length of the passed array
											        if (arrayLength==0 || arrayLength==1){
											            return arrayLength;
											        }
											        //Creating a temporary array of the passed array lenght
											        int[] temp = new int[arrayLength];
											        int j = 0;
											        //For Loop itteration
											        for (int i=0; i<arrayLength-1; i++){
											            if (array[i] != array[i+1]){
											                temp[j++] = array[i];
											            }
											         }
											        //Setting the last element of array to the temp
											        temp[j++] = array[arrayLength-1];
											        // Changing original array
											        for (int i=0; i<j; i++){
											            array[i] = temp[i];
											        }
											        return j;
											    }	
														
														
													static class Naruto{
														
														int a;int i;
														
														public Naruto(int a ,int i) {
															// TODO Auto-generated constructor stub
														this.a=a;
														this.i=i;
														}
														
													}
													
													
													
													
											
													
												static long power1(long x, long y, long p) 
											    { 
											        // Initialize result 
											        long res = 1;      
											         
											        // Update x if it is more   
											        // than or equal to p 
											        x = x % p;  
											  
											       if (x == 0) return 0; // In case x is divisible by p;    
											  
											        while (y > 0) 
											        { 
											            // If y is odd, multiply x 
											            // with result 
											            if((y & 1)==1) 
											                res = (res * x) % p; 
											      
											            // y must be even now 
											            // y = y / 2 
											            y = y >> 1;  
											            x = (x * x) % p;  
											        } 
											        return res; 
											    } 	
									static void dfs(ArrayList<ArrayList<graph>> g,int v,boolean visited[]) {
										
										visited[v]=true;
										l[k]+=1;
										for(graph j:g.get(v)) {
											if(j.c==0) {
												//System.out.println(v);
												if(!visited[j.v])
												dfs(g,j.v,visited);  
											}
											
										}
										
										
									}
												
												
									static class graph{
										int v;int c;
										public graph(int v,int c) {
											// TODO Auto-generated constructor stub
											this.v=v;
											this.c=c;
										
										}
										
									}
												
												
													
												
										static		long fact(long n) {
													
													if(n<=1)return 1;
													else return n*fact(n-1);
												}
												
								 static long maxCrossingSum(long arr[], int l, 
							                                int m, int h) 
							    { 
							        // Include elements on left of mid. 
							       long sum = 0; 
							        long left_sum = Integer.MIN_VALUE; 
							        for (int i = m; i >= l; i--) 
							        { 
							            sum = sum + arr[i]; 
							            if (sum > left_sum) 
							            left_sum = sum; 
							        } 
							  
							        // Include elements on right of mid 
							        sum = 0; 
							        long right_sum = Integer.MIN_VALUE; 
							        for (int i = m + 1; i <= h; i++) 
							        { 
							            sum = sum + arr[i]; 
							            if (sum > right_sum) 
							            right_sum = sum; 
							        } 
							  
							        // Return sum of elements on left 
							        // and right of mid 
							       // returning only left_sum + right_sum will fail for [-2, 1] 
							        return Math.max(left_sum + right_sum, Math.max(left_sum, right_sum)); 
							    } 
							  
							    // Returns sum of maxium sum subarray  
							    // in aa[l..h] 
							    static long maxSubArraySum(long arr[], int l,  
							                                      int h) 
							    { 
							    // Base Case: Only one element 
							    if (l == h) 
							        return arr[l]; 
							  
							    // Find middle point 
							    int m = (l + h)/2; 
							  
							    /* Return maximum of following three  
							    possible cases: 
							    a) Maximum subarray sum in left half 
							    b) Maximum subarray sum in right half 
							    c) Maximum subarray sum such that the  
							    subarray crosses the midpoint */
							    return Math.max(Math.max(maxSubArraySum(arr, l, m), 
							                    maxSubArraySum(arr, m+1, h)), 
							                    maxCrossingSum(arr, l, m, h)); 
							    } 
												
												static long abs(long a) {
													return Math.abs(a);
												}
												
												static class seg{
													
													int x;int y;int l;
													public seg(int x,int y,int l) {
														this.x=x;
														this.y=y;
														this.l=l;
														// TODO Auto-generated constructor stub
													}
													
													
												}
											static	boolean isPresent(int j,int p) {
													
													int i=(j/50)%475;
													
													for(int k=0;k<25;k++) {
													    i = (i * 96 + 42)% 475;
													    if(26+i==p)return true;
														}
													return false;
													
												}
																				
												static class Helper{
													int val;int index;
													public Helper(int  val,int index) {
														
														this.val=val;
														this.index=index;
														// TODO Auto-generated constructor stub
													}
												}
											
										
												
								
											    static boolean isPrime(long n) 
											    { 
											        // Corner cases 
											        if (n <= 1) 
											            return false; 
											        if (n <= 3) 
											            return true; 
											  
											        // This is checked so that we can skip 
											        // middle five numbers in below loop 
											        if (n % 2 == 0 || n % 3 == 0) 
											            return false; 
											  
											        for (long i = 5l; i * i <= n; i = i + 6) 
											            if (n % i == 0 || n % (i + 2) == 0) 
											                return false; 
											  
											        return true; 
											    } 
										
												      
												    /* Iterative Function to calculate 
												       (x^y)%p in O(log y) */
												    static long power(long x, long y, long p) 
												    { 
												        // Initialize result 
												        long res = 1;      
												         
												        // Update x if it is more   
												        // than or equal to p 
												        x = x % p;  
												  
												       if (x == 0) return 0; // In case x is divisible by p;    
												  
												        while (y > 0) 
												        { 
												            // If y is odd, multiply x 
												            // with result 
												            if((y & 1)==1) 
												                res = (res * x) % p; 
												      
												            // y must be even now 
												            // y = y / 2 
												            y = y >> 1;  
												            x = (x * x) % p;  
												        } 
												        return res; 
												    } 
									
												
												
												
												  static class InputReader {
												        private InputStream stream;
												        private byte[] buf = new byte[1024];
												        private int curChar;
												        private int numChars;
												        private SpaceCharFilter filter;
											
												        public InputReader(InputStream stream) {
												            this.stream = stream;
												        }
											
												        public int read() {
												            if (numChars == -1)
												                throw new InputMismatchException();
												            if (curChar >= numChars) {
												                curChar = 0;
												                try {
												                    numChars = stream.read(buf);
												                } catch (IOException e) {
												                    throw new InputMismatchException();
												                }
												                if (numChars <= 0)
												                    return -1;
												            }
												            return buf[curChar++];
												        }
											
												        public int readInt() {
												            int c = read();
												            while (isSpaceChar(c))
												                c = read();
												            int sgn = 1;
												            if (c == '-') {
											    sgn = -1;
											    c = read();
											}
											int res = 0;
											do {
											    if (c < '0' || c > '9')
											        throw new InputMismatchException();
											    res *= 10;
											    res += c - '0';
											        c = read();
											    } while (!isSpaceChar(c));
											    return res * sgn;
											}
											
											public String readString() {
											    int c = read();
											    while (isSpaceChar(c))
											        c = read();
											    StringBuilder res = new StringBuilder();
											    do {
											        res.appendCodePoint(c);
											        c = read();
											    } while (!isSpaceChar(c));
											    return res.toString();
											}
											
											public boolean isSpaceChar(int c) {
											    if (filter != null)
											        return filter.isSpaceChar(c);
											    return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
												        }
											
												        public String next() {
												            return readString();
												        }
											
												    }
												
												  public interface SpaceCharFilter {
												        public boolean isSpaceChar(int ch);
												    }	
												
												
																					
																					
																					
																		
											}