Given a binary tree, find the depth of the deepest odd level leaf node in a binary tree. Consider that level starts with 1. Depth of a leaf node is number of nodes on the path from root to leaf (including both leaf and root).

**Input:**

The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case contains an integer n denoting the number of edges. The next line contains the edges of the binary tree.

**Output:**

Print the depth of the deepest odd level leaf node in the binary tree.

**Constraints:**

1<=T<=1000

1<=n<=1000

1<=data of node<=1000

**Example:**

Input:

2

10

1 2 L 2 4 L 1 3 R 3 5 L 3 6 R 5 7 R 7 9 L 6 8 R 8 10 R 10 11 L

4

1 2 L 2 4 L 1 3 R 3 5 L

**Output:**

5

3

#### **For More Examples Use Expected Output**