//#pragma comment(linker, "/STACK:102400000, 102400000")

 #include <algorithm>

 #include <iostream>

 #include <cstdlib>

 #include <cstring>

 #include <cstdio>

 #include <vector>

 #include <cmath>

 #include <ctime>

 #include <list>

 #include <set>

 #include <map>

 using namespace std;

 typedef long long LL;

 typedef pair <int, int> P;

 const int N = 1e5 + ;

 int a[N];

 int main()

 {

     int t, n;

     scanf("%d", &t);

     while(t--) {

         scanf("%d", &n);

         for(int i = ; i <= n; ++i) {

             scanf("%d", a + i);

         }

         int Max = , num = a[];

         for(int i = ; i <= n; ++i) {

             if(Max %  && a[i] < num) {

                 Max++;

             } else if(Max %  ==  && a[i] > num) {

                 Max++;

             }

             num = a[i];

         }

         printf("%d\n", Max);

     }

     return ;

 }