#include <sstream>
#include <cmath>
#include <bits/stdc++.h>
#define int long long int
#define vec vector<int>
#define vecv vector<vec>
#define vecs vector<string>
#define vecp vector<pair<int,int>>
#define vecc vector<char>

#define pb push_back
#define mp make_pair
#define lb lower_bound  //THIS GIVES THE ITR TO THE ELEMENT IN RANGE [SI,EI) THAT IS >= OUR VALUE
#define ub upper_bound  //THIS GIVES THE ITR TO THE ELEMENT IN RANGE [SI,EI) THAT IS > OUR VALUE
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fton() for(int i=0;i<n;i++)
#define f(i,a,b) for(int i=a;i<b;i++)
#define fr(i,a,b) for(int i=a;i>=b;i--)

#define endl "\n"
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
#define one cout<<-1<<endl
#define F first
#define S second
#define maxe(v) *max_element(all(v))
#define mine(v) *min_element(all(v))
#define cout(v) for(auto&it:(v))cout<<it<<" ";cout<<endl;
#define coutF(v) for(auto&it:(v))cout<<it.F<<" ";cout<<endl;
#define coutS(v) for(auto&it:(v))cout<<it.S<<" ";cout<<endl;
#define cin(v) for(auto&it:(v))cin>>it;
#define err1 cout<<"**********"<<endl;
#define M 1000000007
#define PI 3.141592653589793238
#define inf 1e16
using namespace std;

int pow1(int n,int p)
{
    if(p==0) return 1;
    int x=pow1(n, p/2);
    x=(x*x)%M;
    if(p%2==0) return x;
    return (x*n)%M;
}

vec adj[100001];
vec vis(100001);
void dfs(int n)
{
    vis[n]=1;
    for(int i=0;i<adj[n].size();i++)
    {
        if(vis[adj[n][i]]==0)
        {
            dfs(adj[n][i]);
        }
    }
}

void solve()
{
    int n;
    cin>>n;
    vec v(n);
    cin(v);
    vec c=v;
    sort(all(c));
    vec ve;
    vec vo;
    fton()
    {
        if(i%2==0)ve.pb(v[i]);
        else vo.pb(v[i]);
    }
    sort(all(vo));
    sort(all(ve));
    vec res;
    for(int i=0;i<ceil((n*1.0)/2);i++)
    {
        res.pb(ve[i]);
        if(i<vo.size())
        res.pb(vo[i]);
    }
    if(res==c)yes;
    else no;
}


int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int t=1;
    cin>>t;
    for(int i=1;i<=t;i++)
    {
        //f(i,0,100001)adj[i].clear();
        //fill(all(vis),0);
        solve();
    }
    return 0;
}
