Strictly Increasing Sequence Check

You are given several sequences of integers. For each sequence, determine whether it is strictly increasing. A sequence (a_1, a_2, \dots, a_n) is strictly increasing if for every (i) ((1 \le i < n)) it holds that (a_{i} < a_{i+1}). Note that by definition, an empty sequence or a sequence with a single element is considered strictly increasing.

inputFormat

The input is read from standard input and begins with an integer (T) representing the number of test cases. Each test case consists of a line starting with an integer (N) (the length of the sequence), followed by (N) space-separated integers. For example, a test case might look like:

5 1 3 5 7 9

This represents a sequence with 5 elements: 1, 3, 5, 7, 9.

outputFormat

For each test case, print a single line containing either True if the sequence is strictly increasing, or False otherwise.## sample

1
1 1

True