#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h> 
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <random>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <stack>
#include <iomanip>
#include <fstream>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
typedef pair<double,double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int> > vv32;
typedef vector<vector<ll> > vv64;
typedef vector<vector<p64> > vvp64;
typedef vector<p64> vp64;
typedef vector<p32> vp32;
ll MOD = 998244353;
double eps = 1e-12;
#define forn(i,e) for(ll i = 0; i < e; i++)
#define forsn(i,s,e) for(ll i = s; i < e; i++)
#define rforn(i,s) for(ll i = s; i >= 0; i--)
#define rforsn(i,s,e) for(ll i = s; i >= e; i--)
#define ln "\n"
#define dbg(x) cout<<#x<<" = "<<x<<ln
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define INF 2e18
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
 

void solve(){
    int n;
    cin>>n;
    vector<int> arr(n);
    for(auto &e : arr) {
        cin>>e;
    }
    //ayo wuss poppin
    
    ll ans=0;
    for(int len=3; len<=4; len++) {
        if(len>n) break;
        for(int i=0; i<n-len+1; i++) {
            vector<int> subarr;
            bool ok=1;
            for(int j=i; j<len+i; j++) {
                subarr.pb(arr[j]);
            }
            for(int i=0; i<len; i++) {
                for(int j=i+1; j<len; j++) {
                    for(int k=j+1; k<len; k++) {
                        if(subarr[i]<=subarr[j]&&subarr[j]<=subarr[k]) {
                            ok=0;
                        }
                        if(subarr[i]>=subarr[j]&&subarr[j]>=subarr[k]) {
                            ok=0;
                        }
                    }
                }
            }
            if(ok) {
                ans++;
            }
        }

    }
    ans+=2*n-1;
    cout<<ans<<endl;
}
int main()
{
    fast_cin();
    int t;
    cin>>t;
    while(t--) {
        solve();
    }
}