#include <bits/stdc++.h>
using namespace std;
using ui32 = unsigned int;
using i64 = long long;
using f64 = long double;
using ui64 = unsigned long long;
inline int log2(int x) {
  int cnt = 0;
  while (x >>= 1) {
    cnt++;
  }
  return (cnt);
}
inline int positive_bits_cnt(int x) {
  int cnt = 0;
  while (x >>= 1) {
    if (x & 1) {
      cnt++;
    }
  }
  return (cnt);
}
int ufact(int l, int r) {
  if (l == r) {
    return (l);
  } else if (l > r) {
    return (1);
  }
  int d = (l + r) / 2;
  return ufact(l, d) * ufact(d + 1, r);
}
const int arr = 200014;
const int misha_arr = 30000007;
const int arr1 = 1014;
const int arr2 = 66;
const i64 bbig = 1000000000000000007;
const int mod = 1000000007;
const int inf = (1 << 31);
inline i64 gcd(i64 a, i64 b) { return (b ? gcd(b, a % b) : a); }
void file(string s) {
  const string ss = s + ".in", sss = s + ".out";
  freopen(ss.c_str(), "r", stdin);
  freopen(sss.c_str(), "w", stdout);
}
void print(string s, i64 k = 1) {
  for (i64 i = 0; i < k; i++) {
    cout << s;
  }
}
void print1(i64 a, i64 b) {
  print("l", a);
  print("r10lt", b);
}
int32_t main() {
  print("d");
  print("d0usut0dtl", 31);
  print("uuu");
  print("ru0dsdt0ut", 31);
  print("drrr0llld");
  for (i64 i = 0; i < 31; i++) {
    print1(i, i);
    print("u");
    print1(i, i + 1);
    print("d010ltutr10ltr010ltut");
    print1(0, 31 - i);
    print("l", 31 - i);
    print("100ltutll100ltutd10utrr10utl10ltrtu10dtu10dtr10ltdlll");
  }
  print("rrrr");
  return 0;
}
