#include<iostream>
#include<vector>
#include<cmath>
#include<algorithm>
using namespace std;
vector<string> strs;
int H,W;
bool isroad(int fx,int fy,int tx,int ty){
    int fromx,fromy,tox,toy;
    fromx=min(fx,tx);
    fromy=min(fy,ty);
    tox=max(fx,tx);
    toy=max(fy,ty);
    if(fromx<1 || tox<1 || tox>W || fromx>W || fromy<1 || toy<1 || fromy>H || toy>H) return false;
    if(fromx==tox){
        if(strs[(fromy-1)*2+1][fromx-1]=='1') return true;
        else{
            return false;
        }
    }else{
        if(strs[(fromy-1)*2][fromx-1]=='1') return true;
        else{
            return false;
        }
    }
}
int vx[]={1,0,-1,0},vy[]={0,-1,0,1};
int main(){
    string ins;
    while(cin>>ins){
        strs.push_back(ins);
    }
    W=strs[0].size()+1;
    H=strs.size()/2+1;
    int nx=2,ny=1,v=0;
    string outs="R";
    while(nx!=1 || ny!=1){
        for(int i=5;i>=3;i--){
            bool r=isroad(nx,ny,nx+vx[(v+i)%4],ny+vy[(v+i)%4]);
            if(r){
                v=(v+i)%4;
                nx+=vx[v];
                ny+=vy[v];
                if(v==0) outs+='R';
                else if(v==1) outs+='U';
                else if(v==2) outs+='L';
                else outs+='D';
                break;
            }
        }
    }
    cout<<outs<<endl;
}