/*  Erica N  */
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define endl '\n'
#define mp make_pair
// #define int long long
#define ull unsigned long long
#define pii pair<int, int>
#define ps second
#define pf first
#define itn int
#define rd read()
int read(){
    int xx = 0, ff = 1;char ch = getchar();
    while (ch < '0' || ch > '9') {if (ch == '-')ff = -1; ch = getchar();}
    while (ch >= '0' && ch <= '9')xx = xx * 10 + (ch - '0'), ch = getchar();
    return xx * ff;
}
// void write(int out) {
// 	if (out < 0)
// 		putchar('-'), out = -out;
// 	if (out > 9)
// 		write(out / 10);
// 	putchar(out % 10 + '0');
// }
#define cdbg(x...) do { cerr << #x << " -> "; err(x); } while (0)
void err() { cerr << endl; }
template<template<typename...> class T, typename t, typename... A>
void err(T<t> a, A... x) { for (int v: a) cerr << v << ' '; err(x...); }
template<typename T, typename... A>
void err(T a, A... x) { cerr << a << ' '; err(x...); }


const int N = 1e4 + 5;
const int INF = 1e18;
const int M = 1e7;
const int MOD = 1e9 + 7;

int ans[1005],top;
int lst[1005][N];

int a[1005],pre[1005];
bool f[1005][N];
int _id[N];
unordered_map<int,int> id;

inline int lowbit(int x){
    return x&-x;
}
inline bool check(int a){
    int x=a;
    int res=0;
    while(a){
        res+=a&1;
        a>>=1;
    }

    if(res==1)return 1;
    if(res>2)return 0;
    return lowbit(x)==lowbit(x>>14);
}

inline bool able(int a,int x){
    if(lowbit(a)<x&&a)return 0;
    return 1;
}


void solve() {
    // freopen(".in","r",stdin);
    // freopen(".out","w",stdout);


    int n=rd;
    for(int i=1;i<=n;i++){
        a[i]=rd;
        pre[i]=pre[i-1]+a[i];
    }


    // f.reset();

    f[0][0]=1;
    for(int i=1;i<=n;i++){
        for(int s=0;s<=(1<<13);s++){
            if(s>pre[i-1])break;
            if(f[i-1][s]){
                if(able(s,a[i])){
                    // cdbg("L",s,i);
                    f[i][s+a[i]]=1;
                    lst[i][s+a[i]]=s;
                } 
                if(able(pre[i-1]-s,a[i])){
                    // cdbg("R",s,i);
                    f[i][s]=1;
                    lst[i][s]=s;
                }
            }

        }
    }


    for(int s=0;s<=pre[n];s++){
        // if(f[s])cdbg(s);
        if(f[n][s]&&check(s<<14|(pre[n]-s))==1){
            int cur=n;
            while(cur){
                ans[++top]=(lst[cur][s]==s);
                s=lst[cur--][s];
            }

            while(n){
                if(ans[n--])putchar('r');
                else putchar('l');
            }
            puts("");
            return ;
        }
    }

    puts("no");
}

signed main(){
    solve();
}