PROGRAMMING:The soul of a bird
As we all know, the soul of sparrow is a mahjong game
Ln's mahjong skills are quite high. Today, a primary school sister asked him how to play mahjong
But because ln has to be the first in national service, she's lazy
So he left the problem to you
Very simple, you just need to judge whether the card type given by the title can match the specific card type
1. There is only one type of card (bar, cake, WAN) in jiulianbaodeng, of which 19 are three cards each, and the other one can be added with any card of the current type
2. Seven pairs (seven different pairs)
3. Guoshiwushuang needs Tiao, Pai (tube), Wan's Yaojiu (1 and 9, 6 cards in total) + all the wind cards (7 cards in the white hair in the East, West, North and South) + any one of the cards in front
Of course, sometimes a thousand is inevitable, so you need to judge whether the deck is legal (there are only four cards of each type)
Each card has four identical cards from 1-9 and W1, W2, W3, W7, W8, w9, and four identical cards from wind and white hair. There are 136 cards.
###Input format:
The first line contains an N, followed by N lines, each with a string.
If the current characters are t, B and W, then they represent bar, pie (tube) and ten thousand respectively. They will be followed by a number. For example, T2 represents two cylinders, W3 represents 30000.
If the current character is one of zxcvjkl, they directly represent one of the wind cards.
###Output format:
For each string, determine the card type:
1 seven pairs: "Qidui"
Jiulian baodeng: "Jiulian Baoding!"
"32000!" is unparalleled in three countries
4. If none of them match, output "zhahu"
###Input example:
Here is a set of inputs. For example:
```in
one
zxcvjklt1t9w1w9b1b9l
```
###Output example:
The corresponding output is given here. For example:
```out
32000!
```
answer：If there is no answer, please comment
Ln's mahjong skills are quite high. Today, a primary school sister asked him how to play mahjong
But because ln has to be the first in national service, she's lazy
So he left the problem to you
Very simple, you just need to judge whether the card type given by the title can match the specific card type
1. There is only one type of card (bar, cake, WAN) in jiulianbaodeng, of which 19 are three cards each, and the other one can be added with any card of the current type
2. Seven pairs (seven different pairs)
3. Guoshiwushuang needs Tiao, Pai (tube), Wan's Yaojiu (1 and 9, 6 cards in total) + all the wind cards (7 cards in the white hair in the East, West, North and South) + any one of the cards in front
Of course, sometimes a thousand is inevitable, so you need to judge whether the deck is legal (there are only four cards of each type)
Each card has four identical cards from 1-9 and W1, W2, W3, W7, W8, w9, and four identical cards from wind and white hair. There are 136 cards.
###Input format:
The first line contains an N, followed by N lines, each with a string.
If the current characters are t, B and W, then they represent bar, pie (tube) and ten thousand respectively. They will be followed by a number. For example, T2 represents two cylinders, W3 represents 30000.
If the current character is one of zxcvjkl, they directly represent one of the wind cards.
###Output format:
For each string, determine the card type:
1 seven pairs: "Qidui"
Jiulian baodeng: "Jiulian Baoding!"
"32000!" is unparalleled in three countries
4. If none of them match, output "zhahu"
###Input example:
Here is a set of inputs. For example:
```in
one
zxcvjklt1t9w1w9b1b9l
```
###Output example:
The corresponding output is given here. For example:
```out
32000!
```
answer：If there is no answer, please comment