Good Sequence

Problem Description

You are given a sequence $A_1, A_2, \dots, A_n$ of length $n$. A sequence $\{A\}$ is called good if and only if for every subinterval $[l, r]$ there exists at least one element $x$ that appears exactly once in that subinterval.

Input Format

There are multiple test cases.

The first line contains an integer $T$ ($1 \le T \le 10000$), the number of test cases.

For each test case, the first line contains an integer $n$, and the second line contains $n$ integers $A_i$.

Output Format

For each test case, determine whether the given sequence is good. If it is good, output non-boring; otherwise output boring.

Sample Input

4
5
1 2 3 4 5
5
1 1 1 1 1
5
1 2 3 2 1
5
1 1 2 1 1

Sample Output

non-boring
boring
non-boring
boring

Constraints

For all data, $1 \le n \le 2 \times 10^5$, $\sum n \le 10^6$, and $1 \le A_i \le 10^9$.