import java.io.IOException; 
import java.io.InputStream; 
import java.io.PrintWriter; 
import java.util.*; 
 

class Main{ 

	static void solve(){ 
		int n = ni();
		long[] u = new long[n];
		long[] v = new long[n];
		long x0=nl(), y0=nl();
		u[0] = x0+y0; v[0] = x0-y0;
		for(int i=1;i<n;++i){
			long x=nl();
			long y=nl();
			if((Math.abs(x0+y0))%2 != (Math.abs(x+y)%2)){
				out.println(-1);return;
			}
			u[i] = x+y;
			v[i] = x-y;
		}
		List<Long> d = new ArrayList<>();
		String pre = "";
		if(Math.abs(x0+y0)%2==0){
			out.print("1 ");
			for(int i=0;i<n;++i){
				u[i]-=1;v[i]-=1;
			}
			pre="R";
		}
		for(int i=31;i>=0;--i)d.add((1l<<i));
		System.out.println(d.size() + (Math.abs(x0+y0)%2==0 ? 1: 0));
		for(long dd: d)out.print(dd+" ");out.println();
		for(int i=0;i<n;++i){
			String ans = pre;
			long uu=0, vv=0;
			for(long dd: d){
				if(u[i]>uu && v[i]>vv){
					ans+="R";
					uu+=dd; vv+=dd;
				}else if(u[i]>uu && v[i]<vv){
					ans+="U";
					uu+=dd; vv-=dd;
				}else if(u[i]<uu && v[i]>vv){
					ans+="D";
					uu-=dd; vv+=dd;
				}else{
					ans+="L";
					uu-=dd; vv-=dd;
				}
			}
			out.println(ans);

			long xx=0, yy=0;
			if(Math.abs(x0+y0)%2==0){
				xx=1;
			}
			for(int k=0;k<d.size();++k){
				int index = k+((x0+y0)%2==0 ? 1:0);
				switch(ans.charAt(index)){
					case 'R':
						xx+=d.get(k);break;
					case 'L':
						xx-=d.get(k);break;
					case 'U':
						yy+=d.get(k);break;
					case 'D':
						yy-=d.get(k);break;
				}
			}

		}

	} 
 
 
 
 
	 public static void main(String[] args){ 
		 solve(); 
		 out.flush(); 
	 } 
	 private static InputStream in = System.in; 
	 private static PrintWriter out = new PrintWriter(System.out); 
 
	 static boolean inrange(int y, int x, int h, int w){ 
		 return y>=0 && y<h && x>=0 && x<w; 
	 } 
	 @SuppressWarnings("unchecked") 
	 static<T extends Comparable> int lower_bound(List<T> list, T key){ 
		 int lower=-1;int upper=list.size(); 
		 while(upper - lower>1){ 
		 int center =(upper+lower)/2; 
		 if(list.get(center).compareTo(key)>=0)upper=center; 
		 else lower=center; 
		 } 
		 return upper; 
	 } 
	 @SuppressWarnings("unchecked") 
	 static <T extends Comparable> int upper_bound(List<T> list, T key){ 
		 int lower=-1;int upper=list.size(); 
		 while(upper-lower >1){ 
		 int center=(upper+lower)/2; 
		 if(list.get(center).compareTo(key)>0)upper=center; 
		 else lower=center; 
		 } 
		 return upper; 
	 } 
	 @SuppressWarnings("unchecked") 
	 static <T extends Comparable> boolean next_permutation(List<T> list){ 
		 int lastIndex = list.size()-2; 
		 while(lastIndex>=0 && list.get(lastIndex).compareTo(list.get(lastIndex+1))>=0)--lastIndex; 
		 if(lastIndex<0)return false; 
		 int swapIndex = list.size()-1; 
		 while(list.get(lastIndex).compareTo(list.get(swapIndex))>=0)swapIndex--; 
		 T tmp = list.get(lastIndex); 
		 list.set(lastIndex++, list.get(swapIndex)); 
		 list.set(swapIndex, tmp); 
		 swapIndex = list.size()-1; 
		 while(lastIndex<swapIndex){ 
		 tmp = list.get(lastIndex); 
		 list.set(lastIndex, list.get(swapIndex)); 
		 list.set(swapIndex, tmp); 
		 ++lastIndex;--swapIndex; 
		 } 
		 return true; 
	 } 
	 private static final byte[] buffer = new byte[1<<15]; 
	 private static int ptr = 0; 
	 private static int buflen = 0; 
	 private static boolean hasNextByte(){ 
		 if(ptr<buflen)return true; 
		 ptr = 0; 
		 try{ 
			 buflen = in.read(buffer); 
		 } catch (IOException e){ 
			 e.printStackTrace(); 
		 } 
		 return buflen>0; 
	 } 
	 private static int readByte(){ if(hasNextByte()) return buffer[ptr++]; else return -1;} 
	 private static boolean isSpaceChar(int c){ return !(33<=c && c<=126);} 
	 private static int skip(){int res; while((res=readByte())!=-1 && isSpaceChar(res)); return res;} 
 
	 private static double nd(){ return Double.parseDouble(ns()); } 
	 private static char nc(){ return (char)skip(); } 
	 private static String ns(){ 
		 StringBuilder sb = new StringBuilder(); 
		 for(int b=skip();!isSpaceChar(b);b=readByte())sb.append((char)b); 
		 return sb.toString(); 
	 } 
	 private static int[] nia(int n){ 
		 int[] res = new int[n]; 
		 for(int i=0;i<n;++i)res[i]=ni(); 
		 return res; 
	 } 
	 private static long[] nla(int n){ 
		 long[] res = new long[n]; 
		 for(int i=0;i<n;++i)res[i]=nl(); 
		 return res; 
	 } 
	 private static int ni(){ 
		 int res=0,b; 
		 boolean minus=false; 
		 while((b=readByte())!=-1 && !((b>='0'&&b<='9') || b=='-')); 
		 if(b=='-'){ 
			 minus=true; 
			 b=readByte(); 
		 } 
		 for(;'0'<=b&&b<='9';b=readByte())res=res*10+(b-'0'); 
		 return minus ? -res:res; 
	 } 
	 private static long nl(){ 
		 long res=0,b; 
		 boolean minus=false; 
		 while((b=readByte())!=-1 && !((b>='0'&&b<='9') || b=='-')); 
		 if(b=='-'){ 
			 minus=true; 
			 b=readByte(); 
		 } 
		 for(;'0'<=b&&b<='9';b=readByte())res=res*10+(b-'0'); 
		 return minus ? -res:res; 
	} 
} 



Measured memory_bytes: 29908