#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<int,int>

int main(){
  int sx, sy, tx, ty;
  cin >> sx >> sy >> tx >> ty;
  string ans;
    rep(i,ty-sy) ans+='U'; 
    rep(i,tx-sx) ans+='R';
    rep(i,ty-sy) ans+='D'; 
    rep(i,tx-sx) ans+='L';
    ans+='L'; 
    rep(i,ty-sy+1) ans+='U'; 
    rep(i,tx-sx+1) ans+='R'; 
    ans+='D';
    ans+='R';
    rep(i,ty-sy+1) ans+='D'; 
    rep(i,tx-sx+1) ans+='L'; 
    ans+='U';
  cout<<ans<<endl;
}


#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); ++i)
#define REP(i, d, n) for(int i=(d); i<(n); ++i)
#define all(v) v.begin(), v.end()
using ll = long long;
using P = pair<int, int>;

int main() {

	int n;
	cin >> n;
	vector<double> a(n);
	double sum = 0;
	rep(i, n){
		cin >> a[i];
		sum += a[i];
	}

	double k = sum / n;
	double mi = 100000;
	int ans = 0;
	rep(i, n){
		if(mi > abs(a[i]-k)){
			mi = abs(a[i]-k);
			ans = i;
		}
	}
	cout << ans << endl;

    return 0;
}
