This is an interactive problem. Baby Ehab loves crawling around his apartment. It has n rooms numbered from 0 to n-1 . For every pair of rooms, a and b , there 's either a direct passage from room a to room b , or from room b to room a , but never both. Baby Ehab wants to go play with Baby Badawy. He wants to know if he could get to him. However, he doesn 't know anything about his apartment except the number of rooms. He can ask the baby sitter two types of questions: He can ask at most 9n queries of the first type and at most 2n queries of the second type. After asking some questions, he wants to know for every pair of rooms a and b whether there 's a path from a to b or not. A path from a to b is a sequence of passages that starts from room a and ends at room b . The first line contains an integer t ( 1 <= t <= 30 ) -- the number of test cases you need to solve. Then each test case starts with an integer n ( 4 <= n <= 100 ) -- the number of rooms. The sum of n across the test cases doesn 't exceed 500 . To print the answer for a test case, print a line containing "3", followed by n lines, each containing a binary string of length n . The j -th character of the i -th string should be 1 if there 's a path from room i to room j , and 0 if there isn 't. The i -th character of the i -th string should be 1 for each valid i . After printing the answer, we will respond with a single integer. If it 's 1 , you printed a correct answer and should keep solving the test cases (or exit if it is the last one). If it 's -1 , you printed a wrong answer and should terminate to get Wrong answer verdict. Otherwise, you can get an arbitrary verdict because your solution will continue to read from a closed stream. To ask a question of the first type, use the form