#include<iostream>
#include<sstream>
#include<algorithm>
#include<climits>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<cfloat>
#include<functional>
#include<map>
#include<string>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<deque>
#include<set>
#include<bitset>
#include<list>
#include<numeric>
#include<complex>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<long long, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<long long, long long> ll_ll;
typedef pair<double, double> d_d;

#define PI 3.141592653589793238462643383279
#define mod 1000000007LL
#define rep(i, n) for(i = 0;i < n;++i)
#define rep1(i, n) for(i = 1;i < n;++i)
#define rep2d(i, j, n) for(i = 0;i < n;++i)for(j = i + 1;j < n;++j)
#define per(i, n) for(i = n - 1;i > -1;--i)
#define int(x) int x; scanf("%d",&x)
#define int2(x, y) int x, y; scanf("%d%d",&x, &y)
#define int3(x, y, z) int x, y, z; scanf("%d%d%d",&x, &y, &z)
#define sc(x) cin >> x
#define sc2(x, y) cin >> x >> y
#define sc3(x, y, z) cin >> x >> y >> z
#define scn(n, a) rep(i, n)cin >> a[i]
#define sc2n(n, a, b) rep(i, n)cin >> a[i] >> b[i]
#define pri(x) cout << x << "\n"
#define pri2(x, y) cout << x << " " << y << "\n"
#define pri3(x, y, z) cout << x << " " << y << " " << z << "\n"
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define kabe puts("---------------------------")
#define kara puts("")
#define debug(x) cout << " --- " << x << "\n"
#define debug2(x, y) cout << " --- " << x << " " << y << "\n"
#define debug3(x, y, z) cout << " --- " << x << " " << y << " " << z << "\n"
#define debugn(i, n, a) rep(i, n)cout << " --- " << a[i] << "\n";
#define debugin(i, n, a) rep(i, n)printf(" --- %10d\n", a[i])
#define debugi2n(i, n, a, b) rep(i, n)printf(" --- %10d %10d\n", a[i], b[i])
#define debugiin(i, n, a) rep(i, n)printf(" --- %10d %10d\n", a[i].first, a[i].second)
#define X first
#define Y second
#define eps 0.0001
#define prid(x) printf("%.15lf\n", x)



signed main(void){
  int i, j, k;
  int dx[4] = {0, 1, 0, -1};
  int dy[4] = {1, 0, -1, 0};
  string res = "RDLU";
  for(int testcase = 0;testcase < 1234567;testcase++){
    bool f[11][11] = {false};
    string s;
    sc(s);
    rep(i, 4){
      if(s[i] == '1')f[1][i * 2 + 2] = true;
      else f[1][i * 2 + 2] = false;
    }

    rep(i, 4){
      sc(s);
      rep(j, 5){
        if(s[j] == '1')f[i * 2 + 2][2 * j + 1] = true;
        else f[i * 2 + 2][2 * j + 1] = false;
      }
      sc(s);
      rep(j, 4){
        if(s[j] == '1')f[i * 2 + 3][2 * j + 2] = true;
        else f[i * 2 + 3][2 * j + 2] = false;
      }
    }
/*
    rep(i, 11){
      rep(j, 11){
        if(f[i][j])cout << "1";
        else cout << "0";
      }
      kara;
    }*/

    pair<i_i, int> now = mp(mp(0, 2), 0);

    for(int times = 50;times--;){
      if(f[now.X.X + dx[now.Y]][now.X.Y + dy[now.Y]]){
        cout << res[now.Y];
        now.Y = (now.Y + 3) % 4;
      }else{
        now.X.X += dx[now.Y] * 2;
        now.X.Y += dy[now.Y] * 2;
        cout << res[now.Y];
        for(int qwe = 4;qwe--;){
          if(!f[now.X.X + dx[(now.Y + 1) % 4]][now.X.Y + dy[(now.Y + 1) % 4]]){
            now.Y = (now.Y + 1) % 4;
            now.X.X += dx[now.Y] * 2;
            now.X.Y += dy[now.Y] * 2;
          }else break;
        }
      }
      if(now.X.X == 0 && now.X.Y == 2)break;
    }

    kara;

/*/

//*/ break;
  }
  return 0;
}