Stickler is a thief and wants to loot money from a society of n houses placed in a line. He is a weird person and follows a rule while looting the houses and according to the rule he will never loot two consecutive houses. At the same time, he wants to maximize the amount he loots. The thief knows which house has what amount of money but is unable to find the maximum amount he can end up with. He asks for your help to find the maximum money he can get if he strictly follows the rule. Each house has a[i] amount of money present in it.

**Input:**

The first line of input contains an integer T denoting the number of test cases. Each test case contains an integer n which denotes the number of elements in the array a[]. Next line contains space separated n elements in the array a[].

**Output:**

Print an integer which denotes the maximum amount he can take home.

**Constraints:**

1<=T<=200

1<=n<=1000

1<=a[i]<=10000

**Example:
Input:**

2

6

5 5 10 100 10 5

3

1 2 3

110

4

just_kiddin | 48 |

Paras Chadha | 47 |

chaitanyaanimesh | 46 |

Jihye Sofia Seo | 44 |

Anshu Ahirwar | 44 |

gameghost07 | 488 |

xyz2017 | 460 |

N NAGA SAI KRISHNA | 445 |

Anshu Ahirwar | 419 |

Divyasri | 408 |

akhayrutdinov | 3371 |

sanjay05 | 3239 |

Jasleen Kaur 2 | 2012 |

Elite Coder | 1803 |

Michael Riegger | 1788 |