Given an array of integers. The task is to find a peak element in it. An array element is peak if it is not smaller than its neighbors. For corner elements, we need to consider only one neighbor. For example, for input array {5, 10, 20, 15}, 20 is the only peak element. For input array {10, 20, 15, 2, 23, 90, 67}, there are two peak elements: 20 and 90.

**Note:** There may be multiple peak element possible, in that case you may return any valid index.

**Input:**

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

**Output:**

For each test case output will be 1 if the index returned by the function is an peak index.

**Constraints:**

1<=T<=100

1<=N<=100

1<=A[]<=1000

**Example:
Input:**

2

3

1 2 3

2

3 4

1

1

All Is Well | 148 |

ioan | 123 |

praveen2809 | 114 |

Diplav Srivastava | 105 |

Srinivas Chakravarth | 91 |

Lam Ngoc Pham | 405 |

Divvya Sinha | 352 |

All Is Well | 337 |

skull tone | 310 |

KM SUNITA | 301 |

akhayrutdinov | 3798 |

sanjay05 | 3366 |

Jasleen Kaur 2 | 2012 |

Michael Riegger | 2001 |

Quandray | 1931 |