Vladik and Courtesy · Interview Problem

Codeforces

Easy

Math

Simulation

Vladik and Courtesy

Given an integer $n$ , determine whether Vladik can be courteous according to the problem's rule, and print the corresponding result.

Acceptance 0%

Start Practice

Also Available On

Other platform versions and source mappings for the same problem.

Codeforces 811A

gfg

Problem Statement

Problem

Vladik has a number of guests to greet. The answer depends on a simple parity-based rule: for a given integer $n$ , decide which of two possible responses should be produced.

Your task is to read the integer and output the correct response exactly as required.

This is an implementation-style problem with a very small amount of logic, meant to test careful reading and output formatting.

Input Format

A single integer $n$ .

Output Format

Print the required response for the given $n$ .

Constraints

$1 \le n \le 10^9$

Input Format

A single integer $n$ .

Output Format

Print the required response determined by the value of $n$ .

Constraints

$1 \le n \le 10^9$

Examples

Sample cases returned by the problem API.

Example 1

Input

Output

poor conductor

Explanation

For this value, the required response is the negative one.

Example 2

Input

Output

chef

Explanation

For this value, the required response is the positive one.

Premium problem context

Unlock deeper context for this problem

Premium adds guided hints, editorial links, similar variants, discussion resources, and concept maps so you can understand why a problem matters, not just solve it once.

Guided hints

Editorial and discussion links

Concept map and variants

Track your progress