import java.util.Scanner;public class Main{static int x[]={1,0,0,-1};    //方向数组，D<L<R<Ustatic int y[]={0,-1,1,0};static char result[]=new char[1500];static char tmp[]=new char[1500];static char arr[][]=new char[30][50];static int book[][]=new int[30][50];static int count=1500;public static void dfs(int i,int j,char dis,int step){if(step>=count){return;}if(step>0){    //存储方向tmp[step]=dis;}if(i==29 && j==49){    //终点判断count=step;for(int k=1;k<=step;k++){result[k]=tmp[k];}return;}for(int k=0;k<4;k++){int dx=i+x[k];int dy=j+y[k];//越界判断if(dx<0 || dx>29 || dy<0 || dy>49){continue;}if(arr[dx][dy]=='1' || book[dx][dy]==1){continue;}if(k==0){book[dx][dy]=1;dfs(dx,dy,'D',step+1);book[dx][dy]=0;}else if(k==1){book[dx][dy]=1;dfs(dx,dy,'L',step+1);book[dx][dy]=0;}else if(k==2){book[dx][dy]=1;dfs(dx,dy,'R',step+1);book[dx][dy]=0;}else{book[dx][dy]=1;dfs(dx,dy,'U',step+1);book[dx][dy]=0;}}}public static void main(String[] args)    {Scanner reader=new Scanner(System.in);for(int i=0;i<30;i++){String str=reader.nextLine();arr[i]=str.toCharArray();}book[0][0]=1;dfs(0,0,'0',0);for(int i=1;i<=count;i++){System.out.print(result[i]);}}
}

import java.util.ArrayList;
import java.util.Scanner;class A{public int x;public int y;
}public class Main{static int x[]={1,0,0,-1};    //方向数组，D<L<R<Ustatic int y[]={0,-1,1,0};static int row=30;static int rank=50;static char arr[][]=new char[row][rank];static int book[][]=new int[row][rank];        //是否遍历过static char dir[][]=new char[row][rank];    //记录轨迹static ArrayList<A> list=new ArrayList();public static void main(String[] args)    {Scanner reader=new Scanner(System.in);for(int i=0;i<row;i++){String ss=reader.nextLine();arr[i]=ss.toCharArray();}A a=new A();a.x=0;a.y=0;list.add(a);book[0][0]=1;int flag=0;for(int i=0;i<list.size();i++){A tmp=list.get(i);for(int k=0;k<4;k++){int dx=tmp.x+x[k];int dy=tmp.y+y[k];if(dx<0 || dx>row-1 || dy<0 || dy>rank-1){continue;}if(arr[dx][dy]=='1'){continue;}if(book[dx][dy]==1){continue;}book[dx][dy]=1;A c=new A();c.x=dx;c.y=dy;list.add(c);    //加入数组//记录轨迹if(k==0){dir[dx][dy]='D';}else if(k==1){dir[dx][dy]='L';}else if(k==2){dir[dx][dy]='R';}else{dir[dx][dy]='U';}if(dx==row-1 && dy==rank-1){flag=1;break;}}if(flag==1){break;}}ArrayList trace=new ArrayList();int i=row-1;int j=rank-1;while(i!=0 || j!=0){trace.add(dir[i][j]);if(dir[i][j]=='D'){i=i-1;}else if(dir[i][j]=='L'){j=j+1;}else if(dir[i][j]=='R'){j=j-1;}else{i=i+1;}}for(int k=trace.size()-1;k>=0;k--){System.out.print(trace.get(k));}}
}

DDDDRRURRRRRRDRRRRDDDLDDRDDDDDDDDDDDDRDDRRRURRUURRDDDDRDRRRRRRDRRURRDDDRRRRUURUUUUUUULULLUUUURRRRUULLLUUUULLUUULUURRURRURURRRDDRRRRRDDRRDDLLLDDRRDDRDDLDDDLLDDLLLDLDDDLDDRRRRRRRRRDDDDDDRR