#include<iostream>
#include<algorithm>
using namespace std;
int n ;
struct sort2
{
int data;
int index;
}a[6];
int fun(const struct sort2 &p1,const struct sort2 &p2)
{
if((p1.data)<(p2.data))
return 1;
else
return 0;
}
int main()
{
int tc,i;
cin>>tc;
while(tc--)
{
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a[i].data;
a[i].index=i;
}
sort(a,a+n,fun);
int max=0;
for(i=1;i<=n;i++)
{
if((a[i].index)<(a[i+1].index))
max++;
else if((a[i].index)>(a[i+1].index))
max=1;
}
cout<<max<<endl;
}
// getch();
return 0;
}
I2luY2x1ZGU8aW9zdHJlYW0+CiNpbmNsdWRlPGFsZ29yaXRobT4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBuIDsKc3RydWN0IHNvcnQyCnsKICAgICAgICBpbnQgZGF0YTsKICAgICAgICBpbnQgaW5kZXg7Cn1hWzZdOwoKaW50IGZ1bihjb25zdCBzdHJ1Y3Qgc29ydDIgJnAxLGNvbnN0IHN0cnVjdCBzb3J0MiAmcDIpCnsKICAgICAgICBpZigocDEuZGF0YSk8KHAyLmRhdGEpKQogICAgICAgICAgICByZXR1cm4gMTsKICAgICAgICBlbHNlIAogICAgICAgICAgICByZXR1cm4gMDsKfQoKCgppbnQgbWFpbigpCnsKICAgIGludCB0YyxpOwogICAgY2luPj50YzsKICAgIHdoaWxlKHRjLS0pCiAgICB7CiAgICAgICAgICAgY2luPj5uOwogICAgICAgICAgICBmb3IoaT0xO2k8PW47aSsrKQogICAgICAgICAgICB7CiAgICAgICAgICAgICAgICBjaW4+PmFbaV0uZGF0YTsKICAgICAgICAgICAgICAgIGFbaV0uaW5kZXg9aTsKICAgICAgICAgICAgfQogICAgICAgICAgICAKICAgICAgICAgICAgIAogICAgICAgIAogICAgICAgIAogICAgICAgICAgICBzb3J0KGEsYStuLGZ1bik7CiAgICAgICAgICAgIAogICAgICAgICAgICBpbnQgbWF4PTA7CiAgICAgICAgICAgICBmb3IoaT0xO2k8PW47aSsrKQogICAgICAgICAgICB7CiAgICAgICAgICAgICAgICBpZigoYVtpXS5pbmRleCk8KGFbaSsxXS5pbmRleCkpCiAgICAgICAgICAgICAgICAgICAgbWF4Kys7CiAgICAgICAgICAgICAgICAKICAgICAgICAgICAgICAgIGVsc2UgaWYoKGFbaV0uaW5kZXgpPihhW2krMV0uaW5kZXgpKQogICAgICAgICAgICAgICAgICAgIG1heD0xOwogICAgICAgICAgICB9CiAgICAgICAgCiAgICAgICAgICAgIGNvdXQ8PG1heDw8ZW5kbDsKICAgIH0KICAgIAogICAvLyBnZXRjaCgpOwogICAgcmV0dXJuIDA7Cn0KICAg