Tzuyu gave Nayeon a strip of $\ufffd$ cells (numbered $1$ through $\ufffd$) for her birthday. This strip is described by a sequence ${\ufffd}_{1},{\ufffd}_{2},\dots ,{\ufffd}_{\ufffd}$, where for each valid $\ufffd$, the $\ufffd$-th cell is blocked if ${\ufffd}_{\ufffd}=1$ or free if ${\ufffd}_{\ufffd}=0$. Tzuyu and Nayeon are going to use it to play a game with the following rules:

- The players alternate turns; Nayeon plays first.
- Initially, both players are outside of the strip. However, note that afterwards during the game, their positions are always different.
- In each turn, the current player should choose a free cell and move there. Afterwards, this cell becomes blocked and the players cannot move to it again.
- If it is the current player's first turn, she may move to any free cell.
- Otherwise, she may only move to one of the left and right adjacent cells, i.e. from a cell $\ufffd$, the current player may only move to the cell $\ufffd-1$ or $\ufffd+1$ (if it is free).
- If a player is unable to move to a free cell during her turn, this player loses the game.

Nayeon and Tzuyu are very smart, so they both play optimally. Since it is Nayeon's birthday, she wants to know if she can beat Tzuyu. Find out who wins.

### Input

- The first line of the input contains a single integer $\ufffd$ denoting the number of test cases. The description of $\ufffd$ test cases follows.
- The first line of each test case contains a single integer $\ufffd$.
- The second line contains $\ufffd$ space-separated integers ${\ufffd}_{1},{\ufffd}_{2},\dots ,{\ufffd}_{\ufffd}$.

### Output

For each test case, print a single line containing the string `"Yes"`

if Nayeon wins the game or `"No"`

if Tzuyu wins (without quotes).

### Constraints

- $1\le \ufffd\le 40,000$
- $2\le \ufffd\le 3\cdot 1{0}^{5}$
- $0\le {\ufffd}_{\ufffd}\le 1$ for each valid $\ufffd$
- ${\ufffd}_{1}={\ufffd}_{\ufffd}=1$
- the sum of $\ufffd$ over all test cases does not exceed $1{0}^{6}$

### Subtasks

Subtask #1 (50 points): ${\ufffd}_{\ufffd}=0$ for each $\ufffd$ ($2\le \ufffd\le \ufffd-1$)

Subtask #2 (50 points): original constraints

### Sample 1:

4 7 1 1 0 0 0 1 1 8 1 0 1 1 1 0 0 1 4 1 1 0 1 4 1 1 1 1

Yes No Yes No

### Explanation:

Example case 1: Since both Nayeon and Tzuyu play optimally, Nayeon can start e.g. by moving to cell $4$, which then becomes blocked. Tzuyu has to pick either the cell $3$ or the cell $5$, which also becomes blocked. Nayeon is then left with only one empty cell next to cell $4$ (the one Tzuyu did not pick); after she moves there, Tzuyu is unable to move, so she loses the game.

Example case 2: Regardless of what cell Nayeon moves to at the start, Tzuyu will always be able to beat her.

__Code(C++):-__

__Code(JAVA):-__

__Recommended Post ____:-__

__Recommended Post__

__:-__

__HCL Coding Questions:-__

__Capgemini Coding Questions:-__

__iMocha coding Questions:-__

__Tech Mahindra coding questions:-__

__Unthinkable Solutions coding questions:-__- Swap the adjacent characters of the string
- Double the vowel characters in the string
- Character with their frequency
- Program to find the closest value

__Must check this:-__

__Companies interview:-__- Swap adjacent characters
- Double the vowel characters
- Check valid parenthesis
- Print the characters with their frequencies
- Find closest value
- Word Count
- Program of CaesarCipher
- Program to find the perfect city
- Annual Day | Tech Mahindra coding question
- Find the number of pairs in the array whose sum is equal to a given target.

__Full C course:- __

__Key points:-__

- How to set limit in the floating value in python
- What is boolean data type
- How to print any character without using format specifier
- How to check that given number is power of 2 or not
- How to fix limit in double and floating numbers after dot (.) in c++
- How to print a double or floating point number in scientific notation and fixed notation
- How to take input a string in c
- How to reduce the execution time of program in c++.

__Cracking the coding interview:-__

__Array and string:-__

__Tree and graph:-__

__Hackerearth Problems:-__

- Very Cool numbers | Hacker earth solution
- Vowel Recognition | Hackerearth practice problem solution
- Birthday party | Hacker earth solution
- Most frequent | hacker earth problem solution
- program to find symetric difference of two sets
- cost of balloons | Hacker earth problem solution
- Chacha o chacha | hacker earth problem solution
- jadu and dna | hacker earth solution
- Bricks game | hacker earth problem
- Anti-Palindrome strings | hacker earth solution
- connected components in the graph | hacker earth data structure
- odd one out || hacker earth problem solution
- Minimum addition | Hackerearth Practice problem
- The magical mountain | Hackerearth Practice problem
- The first overtake | Hackerearth Practice problem

__Hackerrank Problems:-__- Playing With Characters | Hackerrank practice problem solution
- Sum and Difference of Two Numbers | hackerrank practice problem solution
- Functions in C | hackerrank practice problem solution
- Pointers in C | hackerrank practice problem solution
- Conditional Statements in C | Hackerrank practice problem solution
- For Loop in C | hackerrank practice problem solution
- Sum of Digits of a Five Digit Number | hackerrank practice problem solution
- 1D Arrays in C | hackerrank practice problem solution
- Array Reversal | hackerrank practice problem solution
- Printing Tokens | hackerrank practice problem solution
- Digit Frequency | hackerrank practice problem solution
- Calculate the Nth term | hackerrank practice problem solution

__Data structure:-__

- Program to find cycle in the graph
- Implementation of singly link list
- Implementation of queue by using link list
- Algorithm of quick sort
- stack by using link list
- program to find preorder post order and inorder of the binary search tree
- Minimum weight of spanning tree
- Preorder, inorder and post order traversal of the tree

__ MCQs:-__

## 0 Comments