#include<bits/stdc++.h>
using namespace std;
struct node {
int x;
int y;
string p;
};
char a[31][51];
char k[4]= {'D','L','R','U'};
int dir[4][2]= {{1,0},{0,-1},{0,1},{-1,0}};
int vis[30][50];
void bfs() {
node start;
start.x=0;
start.y=0;
start.p="";
vis[0][0]=1;
queue<node>q;
q.push(start);
while(!q.empty()) {
node now = q.front();
q.pop();
if(now.x==29 && now.y==49) {
cout<<now.p<<endl;
return;
}
for(int i=0; i<4; i++) {
node next;
next.x = now.x+dir[i][0];
next.y = now.y+dir[i][1];
if(next.x<0||next.x>=30||next.y<0||next.y>=50)
continue;
if(vis[next.x][next.y]==1||a[next.x][next.y]=='1')
continue;
vis[next.x][next.y]=1;
next.p = now.p+k[i];
q.push(next);
}
}
}
int main() {
for(int i=0; i<30; i++) cin>>a[i];
bfs();
}