# encoding:utf-8



import copy

import numpy as np

import random



d = int(eval(input()))

christmas = "Christmas"



plus = " Eve"



print((christmas+plus*(25-d)))

#!/usr/bin/env python3

# encoding:utf-8

import copy

import random

import bisect #bisect_left　これで二部探索の大小検索が行える

import fractions #最小公倍数などはこっち

import math

import sys

import collections

from decimal import Decimal # 10進数で考慮できる



mod = 10**9+7

sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000



d = collections.deque()

def LI(): return list(map(int, sys.stdin.readline().split()))



D = int(eval(input()))

ans = "Christmas"

for i in range(25 - D):

    ans += " Eve"

print(ans)
# encoding:utf-8
import copy
import numpy as np
import random

d = int(eval(input()))
christmas = "Christmas"
plus = " Eve"
print((christmas + plus * (25 - d)))

#!/usr/bin/env python3
# encoding:utf-8
import copy
import random
import bisect  # bisect_left　これで二部探索の大小検索が行える
import fractions  # 最小公倍数などはこっち
import math
import sys
import collections
from decimal import Decimal  # 10進数で考慮できる

mod = 10**9 + 7
sys.setrecursionlimit(mod)  # 再帰回数上限はでdefault1000
d = collections.deque()


def LI():
    return list(map(int, sys.stdin.readline().split()))


D = int(eval(input()))
ans = "Christmas"
for i in range(25 - D):
    ans += " Eve"
print(ans)

+#!/usr/bin/env python3 -import numpy as np +import bisect  # bisect_left　これで二部探索の大小検索が行える +import fractions  # 最小公倍数などはこっち +import math +import sys +import collections +from decimal import Decimal  # 10進数で考慮できる -d = int(eval(input())) -christmas = "Christmas" -plus = " Eve" -print((christmas + plus * (25 - d))) +mod = 10**9 + 7 +sys.setrecursionlimit(mod)  # 再帰回数上限はでdefault1000 +d = collections.deque() + + +def LI(): +    return list(map(int, sys.stdin.readline().split())) + + +D = int(eval(input())) +ans = "Christmas" +for i in range(25 - D): +    ans += " Eve" +print(ans)