// Problem: No.2228 Creeping Ghost No.2228 蠕行鬼 // Contest: yukicoder // URL: https://yukicoder.me/problems/no/2228 // Memory Limit: 512 MB // Time Limit: 2000 ms #include #define fastio ios::sync_with_stdio(0), cin.tie(0), cout.tie(0); #define dbg(x) cout << #x << " = " << (x) << "\n"; #define popcount(x) __builtin_popcountll((x)) #define all(v) (v).begin(), (v).end() #define pb emplace_back #define x first #define y second using namespace std; typedef long long ll; typedef pair pll; const int inf = 0x3f3f3f3f; const int mod = 1e9 + 7; string op[] = {"RRDD", "ULRL", "LUDU", "UULL", "RDUD", "RDUD"}; void solve() { int cnt; cin >> cnt; for (int i = 0; i < cnt; i++) { cout << op[0][i]; } if (cnt <= 4) return; int cur = 0; for (int i = 4; i < cnt; i++) { cout << op[cur][i % 4]; if (i && i % 4 == 0) { cur++; if (cur == 6) cur = 0; } } } int main() { fastio; int t = 1; // cin >> t; while (t--) { solve(); } return 0; }