#include <iostream>
#include <vector>
#include <string>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;

pair<int, int> divmod(int a, int b) { return make_pair(a / b, a % b); }

class Solver {
private:
    const int n = 30;
    double score = 0.0;

    pair<int, int> input_query() {
        int si, sj, ti, tj;
        cin >> si >> sj >> ti >> tj;
        return make_pair(si * n + sj, ti * n + tj);
    }

    void output(string path) { cout << path << endl; }

    void input_score() { int in; cin >> in; }

    string query(int s, int t) {
        auto[si, sj] = divmod(s, n);
        auto[ti, tj] = divmod(t, n);
        string res = "";
        int di = ti - si;
        int dj = tj - sj;
        if(di > 0) res += string(di, 'D');
        else res += string(-di, 'U');
        if(dj > 0) res += string(dj, 'R');
        else res += string(-dj, 'L');
        return res;
    }

public:
    void solve() {
        rep(k, 1000) {
            auto[s, t] = input_query();
            string path = query(s, t);
            output(path);
            input_score();
        }
    }
};

int main() {
    Solver solver;
    solver.solve();
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int n , x [103] , y [103] , vis [103];
vector < int > gr [103];
void dfs ( int x )
{
    vis [x] = 1;
    for ( int i = 0 ; i < gr [x] . size () ; i ++ )
    {
        int u = gr [x][i];
        if ( vis [u] ) continue;
        dfs ( u );
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    //freopen("milk.in","r",stdin);
    //freopen("milk.out","w",stdout);
    cin >> n;
    for ( int i = 3 ; i <= n + 2 ; i ++ ) cin >> x [i] >> y [i];
    long double l = 0 , r = 100 , mid;
    while ( abs ( r - l ) >= 1e-8 )
    {
        memset ( vis , 0 , sizeof vis );
        for ( int i = 1 ; i <= n + 2 ; i ++ ) gr [i] . clear ();
        mid = ( l + r ) / 2;
        for ( int i = 3 ; i <= n + 2 ; i ++ )
        {
            if ( 2 * mid > abs ( y [i] + 100 ) )
            {
                gr [i] . push_back ( 1 );
                gr [1] . push_back ( i );
            }
            if ( 2 * mid > abs ( 100 - y [i] ) )
            {
                gr [i] . push_back ( 2 );
                gr [2] . push_back ( i );
            }
            for ( int j = i ; j <= n + 2 ; j ++ )
            {
                long double dx = x [i] - x [j] , dy = y [i] - y [j];
                if ( 4 * mid * mid > dx * dx + dy * dy )
                {
                    gr [i] . push_back ( j );
                    gr [j] . push_back ( i );
                }
            }
        }
        dfs ( 1 );
        if ( vis [2] == 0 ) l = mid;
        else r = mid;
    }
    cout << fixed << setprecision ( 5 ) << l;
}
