#include <bits/stdc++.h>
using namespace std;
using ii = tuple<long long, long long>;
const long long N = 1e6 + 7, inf = 1e9 + 42;
long long binpow(long long a, long long b) {
  if (b == 0) return 1;
  long long res = binpow(a, b / 2);
  if (b % 2)
    return (res * res * a) % 1000000007;
  else
    return (res * res) % 1000000007;
}
bool compare(pair<long long, long long> a, pair<long long, long long> b) {
  return (a.first - a.second > b.first - b.second);
}
long long n;
vector<long long> prime_factors;
signed main() {
  puts("Odd");
  return 0;
}
