#!/usr/bin/env python3

import math


def divisors(n):
    ul = math.ceil(math.sqrt(n)) + 1
    ds = set()
    for i in range(1, ul + 1):
        d, m = divmod(n, i)
        if m == 0:
            ds.add(d)
            ds.add(i)
    return sorted(ds)


def is_even(a, b):
    g = math.gcd(a, b)
    ds = divisors(g)
    return len(ds) % 2 == 0


def main():
    a, b = (int(z) for z in input().split())
    if is_even(a, b):
        print("Even")
    else:
        print("Odd")


if __name__ == '__main__':
    main()