We were afraid of making this problem statement too boring, so we decided to keep it short.

A sequence is called non-boring if its every connected subsequence contains a unique element, i.e. an element such that no other element of that subsequence has the same value.

Given a sequence of integers, decide whether it is non-boring.

Input

The first line contains the number of test cases t. The descriptions of the test cases follow:

Each test case starts with an integer n (1 ≤ n ≤ 200000) denoting the length of the sequence. In the next line the n elements of the sequence follow. The elements are non-negative integers less than 109.

Output

For each test case print a single line containing the word non-boring or boring.