#include <bits/stdc++.h>
using namespace std;
int n;
//int a[21], ans = INT_MAX, s = 0, t;
/int dfs(int idx, int l, int r) {
if (idx > n) {
ans=min(ans,abs(l - r));
return 0;
}
dfs(idx + 1, l + a[idx], r);
dfs(idx + 1, l, r + a[idx]);
}/
int main() {
cin >> n;
cout<<"死法兰西玫瑰"<<endl;
return 0;
}