#include<bits/stdc++.h>
using namespace std;#definedbdouble#definelllonglong#definePirpair<int,int>#definefifirst#definesesecond#definepbpush_back#definem_pmake_pair#defineinf0x3f3f3f3f#defineINF0x3f3f3f3f3f3f3f3f/*==========ACMer===========*/constint N =2e5+10;int a[N];
vector<Pir> p, q;intmain(){int T;scanf("%d",&T);while(T --){
q.clear();
p.clear();int n;scanf("%d",&n);for(int i =1; i <= n; i ++){scanf("%d",&a[i]);if(i %2)
p.pb(m_p(a[i], i));else
q.pb(m_p(a[i], i));}sort(p.begin(), p.end());sort(q.begin(), q.end());for(int i =0; i < p.size(); i ++){
a[(i +1)*2-1]= p[i].fi;}for(int i =0; i < q.size(); i ++){
a[(i +1)*2]= q[i].fi;}int last =-1;int flag =1;for(int i =1; i <= n; i ++){if(a[i]< last){
flag =0;break;}else
last = a[i];}if(flag)printf("YES\n");elseprintf("NO\n");}return0;}