Given 2 sorted arrays A and B of size N each. Print sum of middle elements of the array obtained after merging the given arrays.

**Input:**

The first line contains 'T' denoting the number of testcases. Then follows description of testcases.

Each case begins with a single positive integer N denoting the size of array.

The second line contains the N space separated positive integers denoting the elements of array A.

The third line contains N space separated positive integers denoting the elements of array B.

**Output:**

For each testcase, print the sum of middle elements of two sorted arrays. The number of the elements in the merged array are even so there will be 2 numbers in the center n/2 and n/2 +1. You have to print their sum.

**Constraints:**

1<=T<=50

1<=N<=1000

1<=A[i]<=100000

1<=B[i]<=100000

**Example:**

Input :

1

5

1 2 4 6 10

4 5 6 9 12

Output :

11

Ibrahim Nash | 103 |

Stark_Maverick | 77 |

Eduardo Feo | 66 |

Rohit Sharma 16 | 65 |

Micky_Kt | 62 |

Lam Ngoc Pham | 463 |

All Is Well | 399 |

Divvya Sinha | 374 |

Prateek Gole | 369 |

Ibrahim Nash | 343 |

akhayrutdinov | 3855 |

sanjay05 | 3366 |

Michael Riegger | 2030 |

Jasleen Kaur 2 | 2012 |

Quandray | 1969 |