def main():

    from builtins import int,str,map,list,dict,float,print,len,sorted,max,min

    from itertools import accumulate, permutations, combinations

    from collections import deque, defaultdict, Counter

    from operator import itemgetter

    from bisect import bisect_left, bisect_right, bisect

    from heapq import heappop, heappush

    from fractions import gcd

    import sys, re, math, copy



    input = sys.stdin.readline

    input_list = (lambda: input().rstrip().split())

    input_number = (lambda: int(input()))

    input_number_list = (lambda: list(map(int, input_list())))

    sys.setrecursionlimit(10 ** 6)  # 再帰上限を10＊＊6に



    D = input_number()

    ans = 'Christmas'

    r = 25 - D

    for i in range(r):

        ans+=' Eve'

    print(ans)



def resolve():

    main()



if __name__ == '__main__':

    resolve()

def main():

    from builtins import int,map,list,print

    import sys



    input = sys.stdin.readline

    input_number = (lambda: int(input()))

    

    D = input_number()

    ans = 'Christmas'

    r = 25 - D

    for i in range(r):

        ans+=' Eve'

    print(ans)



def resolve():

    main()



if __name__ == '__main__':

    resolve()

def main():
    from builtins import int, str, map, list, dict, float, print, len, sorted, max, min
    from itertools import accumulate, permutations, combinations
    from collections import deque, defaultdict, Counter
    from operator import itemgetter
    from bisect import bisect_left, bisect_right, bisect
    from heapq import heappop, heappush
    from fractions import gcd
    import sys, re, math, copy

    input = sys.stdin.readline
    input_list = lambda: input().rstrip().split()
    input_number = lambda: int(input())
    input_number_list = lambda: list(map(int, input_list()))
    sys.setrecursionlimit(10**6)  # 再帰上限を10＊＊6に
    D = input_number()
    ans = "Christmas"
    r = 25 - D
    for i in range(r):
        ans += " Eve"
    print(ans)


def resolve():
    main()


if __name__ == "__main__":
    resolve()

def main():
    from builtins import int, map, list, print
    import sys

    input = sys.stdin.readline
    input_number = lambda: int(input())
    D = input_number()
    ans = "Christmas"
    r = 25 - D
    for i in range(r):
        ans += " Eve"
    print(ans)


def resolve():
    main()


if __name__ == "__main__":
    resolve()

-    from builtins import int, str, map, list, dict, float, print, len, sorted, max, min -    from itertools import accumulate, permutations, combinations -    from collections import deque, defaultdict, Counter -    from operator import itemgetter -    from bisect import bisect_left, bisect_right, bisect -    from heapq import heappop, heappush -    from fractions import gcd -    import sys, re, math, copy +    from builtins import int, map, list, print +    import sys -    input_list = lambda: input().rstrip().split() -    input_number_list = lambda: list(map(int, input_list())) -    sys.setrecursionlimit(10**6)  # 再帰上限を10＊＊6に