#include<bits/stdc++.h>
using namespace std;

#define pb push_back
#define ui unsigned int
#define ll long long
#define ull unsigned long long
#define rev(v) reverse(v.begin(),v.end())
#define FOR(a,b) for(int i = (a); i <= (b); ++i)
#define FORD(a,b) for(int i = (a); i >= (b); --i)
#define rev(v) reverse(v.begin(),v.end())
#define sort3(ARR,n) sort(ARR,ARR+n,less<long int>())
#define sort4(ARR,n) sort(ARR,ARR+n,greater<long int>())
#define asort(v) sort(v.begin(),v.end(),less<long int>())
#define desort(v) sort(v.begin(),v.end(),greater<long int>())
#define display(shaan) for (std::vector<int>::const_iterator i = shaan.begin(); i != shaan.end(); ++i) std::cout << *i << ' ';
#define fastScan ios_base::sync_with_stdio(0); cin.tie(NULL);
#define sz(v) (int)v.size();

vector< vector<int> >v;

int main()
{
    fastScan;
    int t;
    cin>>t;
    while(t--){
        ll n;
        cin>>n;
        double x,y,ans;
        ans=0;
        FOR(0,n-1){
            cin>>x>>y;
            ans+=x;
            ans+=y;
        }
        if(ceil(ans/4)==floor(ans/4)||(floor(ans/4)==0))
            cout<<"YES"<<endl;
        else
            cout<<"NO"<<endl;
    }
     // v.clear();
    //v.resize(n+5);
	

    return 0;
}
//yo freaker, don't be a tatti seeker :P

// sys/resource rlimit l limit search