Given an array **A** your task is to tell at which position the equilibrium first occurs in the array. Equilibrium position in an array is a position such that the sum of elements below it is equal to the sum of elements after it.

**Input:**

The first line of input contains an integer T denoting the no of test cases then T test cases follow. First line of each test case contains an integer N denoting the size of the array. Then in the next line are N space separated values of the array A.

**Output:**

For each test case in a new line print the position at which the elements are at equilibrium if no equilibrium point exists print -1.

**Constraints:**

1<=T<=100

1<=N<=100

**Example:
Input:**

2

1

1

5

1 3 5 2 2

1

3

1. Since its the only element hence its the only equilibrium point

2. For second test case equilibrium point is at position 3 as elements below it (1+3) = elements after it (2+2)

:p | 491 |

Anshul Wadhawan | 414 |

Shivam_Kumar_Singh | 316 |

facelessman_x | 312 |

Calahan | 295 |

Anshul Wadhawan | 874 |

rambo | 868 |

Calahan | 816 |

Suraj Kumar 14 | 792 |

fullmetal27 | 758 |

akhayrutdinov | 4698 |

Ibrahim Nash | 3664 |

sanjay05 | 3633 |

Quandray | 3543 |

surbhi_7 | 2748 |