#include<iostream>
#include<algorithm>
using namespace std;
long long n,a[200010],b[200010],p[200010],k,ans,m;
long long f[200010];
int main(){
	cin >> n;
	for(int i=1;i<=n;i++)
	{
	 cin >>a[i];
	 p[i]=max(a[i],p[i-1]);}
	f[1]=2*a[1];b[1]=f[1];
	for(int i=2;i<=n;i++)
	{
	 f[i]=a[i]+i*(p[i]-p[i-1])+b[i-1]+f[i-1];
	 b[i]=p[i]-p[i-1]+b[i-1]+a[i];
	} 
	for(int i=1;i<=n;i++)
	cout << f[i]<<endl;
	return 0;
} 
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repa(i,a,n) for (long long i = (a); i < (long long)(n); i++)
#define Rrep(i,n) for (long long i = (long long)(n)-1; i >= 0; i--)
#define Rrepa(i,a,n) for (long long i = (long long)(n)-1; i >= a; i--)
using ll = long long;
class Prints {
    class __Prints {
    public:
        __Prints(const char* sep, const char* term) : sep(sep), term(term) {}
        template <class... Args>
        void operator()(const Args&... args) const { print(args...); }
        template <typename T>
        void pvec(const T& vec, size_t sz) const {
            for (size_t i = 0; i < sz; i++)
                std::cout << vec[i] << (i == sz - 1 ? term : sep);
        }
        template <typename T>
        void pmat(const T& mat, size_t h, size_t w) {
            for (size_t i = 0; i < h; i++)
                for (size_t j = 0; j < w; j++)
                    std::cout << mat[i][j] << (j == w - 1 ? term : sep);
        }

    private:
        const char *sep, *term;
        void print() const { std::cout << term; }
        void print_rest() const { std::cout << term; }
        template <class T, class... Tail>
        void print(const T& head, const Tail&... tail) const { std::cout << head, print_rest(tail...); }
        template <class T, class... Tail>
        void print_rest(const T& head, const Tail&... tail) const { std::cout << sep << head, print_rest(tail...); }
    };

public:
    Prints() {}
    __Prints operator()(const char* sep = " ", const char* term = "\n") const { return __Prints(sep, term); }
};
Prints print;
//一次元配列はprint().pvec(vec,要素数);
//二次元配列はprint().pmat(vec,要素数1,要素数2);

int main() {
    int si,sj,ti,tj;
    rep(k,1000) {
        cin >> si >> sj >> ti >> tj;
        string ans;
        if (si < ti) rep(i,ti-si) ans += 'D';
        else rep(i,si-ti) ans += 'U';
        
        if (sj < tj) rep(i,tj-sj) ans += 'R';
        else rep(i,sj-tj) ans += 'L';
        cout << ans << endl;

        int score;
        cin >> score;
    }
}