use std::cmp::{max, min};
use std::collections::HashMap;

fn gcd(x: usize, y: usize) -> usize {
    if x % y == 0 { return y; }
    gcd(y, x % y)
}

fn main() {
    let mut ab = String::new();
    std::io::stdin().read_line(&mut ab).ok();
    let ab: Vec<usize> = ab.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
    let a = ab[0];
    let b = ab[1];

    let mut gcd_val = gcd(max(a, b), min(a, b));
    let mut result = 1usize;
    let limit: usize = (gcd_val as f64).sqrt().ceil() as usize;
    let mut mapping: HashMap<usize, usize> = HashMap::new();
    for i in 2..=limit {
        while gcd_val % i == 0 {
            if let Some(x) = mapping.get_mut(&i) {
                *x += 1;
            } else {
                mapping.insert(i, 1);
            }
            gcd_val /= i;
        }
        if gcd_val == 1 { break; }
    }
    if gcd_val > 1 {
        result += 1;
    } else {
        mapping.iter().map(|pair| *pair.1 + 1).for_each(|i| { result *= i; });
    }
    println!("{}", if result % 2 == 0 { "Even" } else { "Odd" });
}