Hide

# Problem A

Eldspýtur

Languages
en
is
Image from Pixabay

## Input

The input is a single line containing two integers $n$ and $k$, the number of matches at the start of the game and the maximum number of matches one may remove in a single move.

## Output

Print `Jebb` if Benni is willing to
play, print `Neibb` otherwise.

## Scoring

Group |
Points |
Constraints |

1 |
20 |
$0 < k,n \leq 5$ |

2 |
40 |
$5 < k,n \leq 100$ |

3 |
40 |
$100 < k,n \leq 10^9$ |

Sample Input 1 | Sample Output 1 |
---|---|

21 3 |
Jebb |

Sample Input 2 | Sample Output 2 |
---|---|

15 7 |
Jebb |

Sample Input 3 | Sample Output 3 |
---|---|

6 1 |
Neibb |