Problem B
Desiigner strengir
Languages
en
is
Arnar recently went to a concert hosting several rappers. There he discovered his new favourite rapper, Desiigner. But he struggled to make out the words he was saying, his rapping was very fast and unclear. But he heard him say a particular word quite frequently, one starting with ’b’. Then there were several occurrences of the letter ’r’ and finally there was a vowel. He isn’t sure but it could have been “brra” or “brrrru”, but clearly not “krrru”, “ba”, “bra”, nor “brrrt”. Furthermore Arnar was sure that none of the other rappers said words like this.
Now Arnar wants to listen to the songs again and luckily Unnar, his friend, had a recording device at the concert. The recording is quite blurry but at least the audio is quite clear.
Now Arnar is listening to one of the sonds, and he heard something that could be a word like the ones Desiigner said. Could this be Desiigner? Help Arnar discover his love of Desiigner by telling him if this word is a Desiigner word or not.
Input
The first and only line of input contains a string containing only English lower case letters and has length $n$, at most $1\, 000$.
Output
If the string is a Desiigner string, print “Jebb”, otherwise print “Neibb”. A string is a Desiigner string if it starts with the letter ‘b’, followed by two or more occurrences of the letter ‘r’ before ending in a single vowel. Vowels are the letters ‘a’, ‘e’, ‘i’, ‘o’, ‘u’ and ‘y’.
Explanation of Sample Inputs
In the first sample the answer is “Neibb” because the number of ‘r’s is less than 2. In the second sample the answer is “Neibb” because there is more than one vowel. In the third sample the answer is “Jebb” becuase it satisfies all the criteria.
Scoring
The solution will be tested on input data of varying difficulty 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 |
Scoring |
Constraints |
|
1 |
50 |
$4 \leq n \leq 1\, 000$, The string will always end with an a |
|
2 |
40 |
$4 \leq n \leq 1\, 000$ |
|
3 |
10 |
No further constraints |
| Sample Input 1 | Sample Output 1 |
|---|---|
bra |
Neibb |
| Sample Input 2 | Sample Output 2 |
|---|---|
brrrrrrrrrrrrrrrrraaaaa |
Neibb |
| Sample Input 3 | Sample Output 3 |
|---|---|
brrrrrrrrrrrrrrrrrrrrrrrrrrrrrrra |
Jebb |
| Sample Input 4 | Sample Output 4 |
|---|---|
krrrrrrrra |
Neibb |
