#include "bits/stdc++.h" using namespace std; #define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i)) #define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i)) #define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i)) static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL; typedef vector vi; typedef pair pii; typedef vector > vpii; typedef long long ll; template static void amin(T &x, U y) { if (y < x) x = y; } template static void amax(T &x, U y) { if (x < y) x = y; } int digitsMod(const char s[], int n, int m) { int x = 0; long long pow10 = 1; for (int i = n - 1; i >= 0; i --) { if ((x += pow10 * (s[i] - '0') % m) >= m) x -= m; pow10 = pow10 * 10 % m; } return x; } int main() { int M; while (~scanf("%d", &M)) { string P = "177635683940025046467781066894531"s; int ans = digitsMod(P.c_str(), P.size(), M); puts(ans % 2 == 0 ? "even" : "odd"); } return 0; }