#include <bits/stdc++.h>

using namespace std;

#define int long long
// #define x first
// #define y second
#define File(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout)

inline void debug() { cerr << '\n'; }
template<typename Type, typename... Other>
inline void debug(const Type& x, const Other&... y) { cerr << x << ' '; debug(y...); }
#define DEBUG(a...) cerr << "[" << #a << "] = ", debug(a);

typedef long long LL;
typedef pair<int, int> PII;

const int N = 200010;
const int INF = 0x3f3f3f3f;

template<typename Type>
inline void read(Type &res)
{
    res = 0;
    int ch = getchar(), flag = 0;
    while (!isdigit(ch)) flag |= ch == '-', ch = getchar();
    while (isdigit(ch)) res = (res << 3) + (res << 1) + (ch ^ 48), ch = getchar();
    res = flag ? -res : res;
}
template<typename Type, typename... Other>
inline void read(Type &res, Other&... y) { read(res), read(y...); }

int n, a[N];

namespace pts20
{
    int que[N], hh = 50, tt = 49;

    void solve()
    {
        for (int state = 0; state < 1 << n; state ++)
        {
            hh = 50, tt = 49;
            for (int k = 1; k <= n; k ++)
            {
                if (state >> (k - 1) & 1)
                {
                    // if (hh <= tt && que[tt] == a[k])
                    //     que[tt] <<= 1;
                    // else que[++ tt] = a[k];
                    que[++ tt] = a[k];
                    // while (hh < tt)
                    //     if (que[hh] == que[hh + 1]) que[++ hh] <<= 1;
                    //     else break;
                }
                else
                {
                    // if (hh <= tt && que[hh] == a[k])
                    //     que[hh] <<= 1;
                    // else que[-- hh] = a[k];
                    que[-- hh] = a[k];
                    // while (hh < tt)
                    //     if (que[tt] == que[tt - 1]) que[-- tt] <<= 1;
                    //     else break;
                }

                while (hh < tt)
                    if (que[hh] == que[hh + 1]) que[++ hh] <<= 1;
                    else break;
                while (hh < tt)
                    if (que[tt] == que[tt - 1]) que[-- tt] <<= 1;
                    else break;
            }
            // while (hh < tt)
            //     if (que[hh] == que[hh + 1]) que[++ hh] <<= 1;
            //     else break;
            // while (hh < tt)
            //     if (que[tt] == que[tt - 1]) que[-- tt] <<= 1;
            //     else break;

            if (hh == tt)
            {
                for (int k = 0; k < n; k ++)
                    if (state >> k & 1) putchar('r');
                    else putchar('l');
                putchar(10);
                return;
            }
        }
        printf("no\n");
    }
}

signed main()
{
    read(n);
    for (int i = 1; i <= n; i ++) read(a[i]);
    if (n <= 30) pts20::solve();
    return 0;
}