Problem: <image>

You have one chip and one chance to play roulette. Are you feeling lucky?

Output

Print your bet. Your chip must be placed entirely within some square (not on an edge or a corner shared by adjacent squares).

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;
import java.math.*;
 
public class main {
    public static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    public static PrintWriter pw = new PrintWriter(System.out);
    public static String line;
    public static StringTokenizer st;
    public static ArrayList<ArrayList<Integer>> adjList;
    public static int[] dx = {-1, 0, 1, 0, -1, 1, 1, -1};
    public static int[] dy = {0, 1, 0, -1, 1, 1, -1, -1};
    public static int INF = 0x3f3f3f3f;
    public static int MOD = 1000000007;

    public static void main(String[] args) throws Exception {
        // int N = Integer.parseInt(br.readLine());
        // st = new StringTokenizer(br.readLine());
        // ArrayList<Integer> A = new ArrayList<Integer>();
        
        // for(int i = 0; i < N; i++){
        //     A.add(Integer.parseInt(st.nextToken()));
        // }

        // boolean f = true;
        // boolean sorted = false;
        // while (!sorted && f) {
        //     sorted = true;
        //     for(int i = 0; i < N; i++) {
        //         if (i != 0 && A.get(i) < A.get(i-1)) {
        //             sorted = false;
        //         }

        //         if (i != 0 && Math.abs(A.get(i) - A.get(i-1)) >= 2) {
        //             f = false;
        //             break;
        //         }
        //     }
        //     Integer k = Collections.max(A);
        //     A.remove(k);
        //     A.add(k);
        // }

        // pw.println(f ? "YES" : "NO");
        pw.println("Odd");

        pw.close(); 
        br.close();
    }
}

class Pair implements Comparable<Pair>{
    public int x, y;
 
    Pair(int _x, int _y){
        x = _x;
        y = _y;
    }
 
    public String toString(){
        return x + "," + y;
    }
 
    public int compareTo(Pair p){
        if(x != p.x) return x < p.x ? 1 : -1;
        else if(y != p.y) return y < p.y ? -1 : 1;
        return 0;
    }
}