##### 2005 Canadian Computing Competition, Stage 2

Given a sequence of positive integers of length , we define a primed subsequence as a consecutive subsequence of length at least two that sums to a prime number greater than or equal to two.

For example, given the sequence:

`3 5 6 3 8`

There are two primed subsequences of length and , one primed subsequence of length , and one primed subsequence of length .

#### Input Specification

Input consists of a series of test cases. The first line consists of an integer , the number of test cases.

Each test case consists of one line. The line begins with the integer , , followed by non-negative numbers less than comprising the sequence. You should note that % of the test cases will have at most numbers in the sequence.

#### Output Specification

For each sequence, print the `Shortest primed subsequence is length x:`

,
where is the length of the shortest primed subsequence, followed by
the shortest primed subsequence, separated by spaces. If there are
multiple such sequences, print the one that occurs first. If there are
no such sequences, print `This sequence is anti-primed.`

.

#### Sample Input

```
3
5 3 5 6 3 8
5 6 4 5 4 12
21 15 17 16 32 28 22 26 30 34 29 31 20 24 18 33 35 25 27 23 19
21
```

#### Sample Output

```
Shortest primed subsequence is length 2: 5 6
Shortest primed subsequence is length 3: 4 5 4
This sequence is anti-primed.
```

## Comments