# [AMPPZ 2012]Formula One

时间限制：10s 空间限制：128MB

### 题目描述

Little Bytie really enjoys watching Formula One races which are held annually on a track between Bytetown and Byteburg. The most exciting moments for him are overtakes. He would like to see as many of them as possible.

Bytie is dreaming of a race in which N Formula One cars compete and the car that started the race at the i-th position (for each 1<i<N) performs Ai overtakes during the race. We assume for simplicity that at each moment of time at most one overtaking takes place, in which exactly two cars participate (that is, one car goes past another car).

Bytie is wondering whether such a race is possible at all. Could you help him figure this out?

有 n 辆赛车，从 1 到 n 依次出发。比赛结束时，你听说第 i 辆车超了 ai

次车。你想判断是否存在一种超车方案满足他所说的。

我们定义，在任意时刻最多只发生一次超车，即恰好两辆车参与这次超车

（一辆车超上了另一辆车）。不存在多辆车同时超过一辆车的情况。

### 输入格式

The first line of input contains one positive integer i that represents the number of test cases that follow.

Each test case is described in two lines. The first line contains one integer N(1<=N<=1000 000): the number of cars that participate in the race. The second line holds a sequence of N integers A1,A2….An(0<=Ai<=10^9) that gives the number of overtakes performed by the respective cars.

The size of a single input file does not exceed 20MB.

### 输出格式

Your program should output T lines containing answers to the respective test cases. Each line should hold a single word TAK (Polish for yes) or NIE (Polish for no) depending on whether the race described by the test case is possible or not.

### 样例输入

3 2 0 1 3 0 1 4 3 1 1 3

### 样例输出

TAK NIE TAK

### 提示

没有写明提示

### 题目来源

没有写明来源