Given an array **arr[]** of **N** integers. Do the following operation **n-1** times. For every **K ^{th}** operation:

- Right rotate the array clockwise by 1.
- Delete the (
**n-k+1**)last element.^{th}

Now, find the element which is left at last.

**Input:**

The first line of input contains an integer **T **denoting the number of test cases. Then **T **test cases follows. Each test case contains two lines. The first line of each test case contains an integer **N**. Then in the next line are **N **space separated values of the array **arr[]**.

**Output:**

For each test case in a new line print the required result.

**Constraints:**

1 <= T <= 110

1 <= N <= 10^{6}

1 <= A[i] <= 10^{7}

**Example:
Input**

2

4

1 2 3 4

6

1 2 3 4 5 6

**Output:**

2

3

**Explanation:
Testcase 2:** A = {1, 2, 3, 4, 5, 6}. Rotate the array clockwise i.e. after rotation the array A = {6, 1, 2, 3, 4, 5} and delete the last element that is {5} so A = {6, 1, 2, 3, 4}. Again rotate the array for the second time and deletes the second last element that is {2} so A = {4, 6, 1, 3}, doing these steps when he reaches 4

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

makeitdonesolo | 64 |

ShubhamJain18 | 64 |

Bishnu Dev Panda | 54 |

DanishBansal | 50 |

abhithakur588 | 50 |

Bishnu Dev Panda | 777 |

yk12 | 512 |

okayboss | 490 |

DevMittal | 472 |

VijethaShastri | 431 |

blackshadows | 5331 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4925 |

Quandray | 4547 |

Login to report an issue on this page.