{"trustable":false,"sections":[{"title":"","value":{"format":"PLAIN","content":"We were afraid of making this problem statement too boring, so we decided to keep it short.A sequenceis called non-boring if its every connected subsequence contains a unique element, i.e. an element suchthat no other element of that subsequence has the same value.Given a sequence of integers, decide whether it is non-boring.\n\nInput\nThe first line of the input contains the number of test cases T. The descriptions of the test cases follow:Each test case starts with an integer n(1\u003c\u003dn\u003c\u003d200000) denoting the length of the sequence. In the next line the n elements of the sequence follow, separated with single spaces. The elements are non-negative integers less than 10^9.\n\nOutput\n\nPrint the answers to the test cases in the order in which they appear in the input. For each test caseprint a single line containing the word `non-boring\u0027 or `boring\u0027.\n\nSample Input\n\n4\n5\n1 2 3 4 5\n5\n1 1 1 1 1\n5\n1 2 3 2 1\n5\n1 1 2 1 1\n\nSample Output\n\nnon-boring\nboring\nnon-boring\nboring\n\n"}},{"title":"","value":{"format":"PLAIN","content":"我们担心这个问题的陈述太过枯燥,所以我们决定将其简短化.如果一个序列的每一个连接的子序列都包含一个唯一的元素,即一个元素使得该子序列中没有其他元素具有相同的值,那么这个序列被称为非无聊序列.给定一个整数序列,决定它是否是非无聊的.\n\n输入内容\n输入的第一行包含测试用例的数量T,测试用例的描述如下:每个测试用例以一个整数n(1\u003c\u003dn\u003c\u003d200000)开始,表示序列的长度。在接下来的一行中,序列的n个元素跟在后面,用单个空格隔开。这些元素是小于10^9的非负整数。\n\n輸出\n\n按输入中出现的顺序打印测试案例的答案。对于每个测试用例,打印一行包含 \"非无聊 \"或 \"无聊 \"的字样。\n\n输入示例\n\n4\n5\n1 2 3 4 5\n5\n1 1 1 1 1\n5\n1 2 3 2 1\n5\n1 1 2 1 1\n\n采样输出\n\n无孔\n无聊\n无孔\n无聊\n\n"}}]}