Hide

Problem B
Liðaskipting

Submissions to this problem will only be marked as accepted if they receive at least a score of 100
Languages en is

In recent years contestants have had the option of grouping up into teams to compete in Forritunarkepni Framhaldsskólanna, but as you know teams can contain up to three people. This hasn’t always gone too well since some people end up being left out. The planning committee have thus decided to take care of team planning themselves, making sure no one is left behind. But they realize that it’s not possible to divide people into three person teams without anyone being left out.

Next year $N$ people intend to compete in Forritunarkeppni Framhaldsskólanna. Can you help the committee check whether it will be possible to divide the $N$ contestants into three person teams without anyone being left out?

Input

One line with the positive integer $N$ denoting the number of people who intend to compete.

Output

A single line containing Jebb if the $N$ contestants can be divided into three person teams without anyone being left out, or Neibb if it is not possible.

Explanation of Sample Inputs

In the first sample $N = 3$ people intend to compete. The answer is Jebb since it’s possible to create one team, leaving no one behind.

In the second sample $N = 14$ people intend to compete. There aren’t enough people to make five teams, but if four teams are made then two people are left behind. Thus it is not possible to divide $14$ people into three person teams, so the answer is Neibb.

In the last sample $N = 300\, 000\, 000\, 000$ people intend to compete. Here we can make $100\, 000\, 000\, 000$ three person teams leaving no one behind. Thus the answer is Jebb.

Scoring

The solution will be tested on differently hard input data and the data is divided into groups as shown in the table below. The solution will then be scored according to how many groups are solved.

Group

Points

Constraints

1

10

$N \leq 3$

2

10

$N \leq 30$

3

20

$N \leq 30\, 000$

4

20

$N \leq 10^{12}$

5

40

$N \leq 10^{100}$

Sample Input 1 Sample Output 1
3
Jebb
Sample Input 2 Sample Output 2
14
Neibb
Sample Input 3 Sample Output 3
300000000000
Jebb

Please log in to submit a solution to this problem

Log in