该比赛已结束，您无法在比赛模式下递交该题目。您可以点击“在题库中打开”以普通模式查看和递交本题。

题目描述

On Saturday, B6e0 Orz went to the bathroom. Then, Oimaster Orz went to jc b6e0. He found that B6e0 Orz wrote some strings in the computer. Those strings all have a substring "b6e0_ak_ioi" in it. He added some other strings in it. We know that Oimaster does not know B6e0's secret, so Oimaster's strings do not have a single substring "b6e0_ak_ioi" in it. They have \(n\) strings in total. Now, you need to help B6e0 recognize whether each string is B6e0's or not.

输入格式

Input is given from Standard Input in the following format:
\(\large n\newline\large s_1\newline\large s_2\newline\dots\newline s_n\)

输出格式

for each \(i(1 \leq i \leq n)\), decide whether the string is made by Oimaster. if it is made by Oimaster, print "1";otherwise, print "0".

输入输出样例

Input #1

3
b6e0_ak_ioi
2h3b4v1j2k3
oimaster_ak_noi,ducati_ak_ioi!!!

Output #1

0
1
1