#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 4000001;
const long double eps = 1E-14;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

mint pw(mint a, ll b) {
	if (b == 0) { return 1; }
	mint ret = pw(a, b >> 1);
	ret *= ret;
	if (b & 1) { ret *= a; }
	return ret;
}

typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;

typedef vector<mint> vmint;
typedef vector<vector<mint>> vvmint;
typedef vector<vector<vector<mint>>> vvvmint;

//////////////////////////////////////
template<typename T>
struct BIT {
	ll n;
	vector<T> bt;
	ll sz;

	BIT(ll n0) {
		n = n0;
		sz = 1;
		while (sz < n) { sz *= 2; }
		bt.assign(sz + 1, 0);
	}

	ll sum(ll i) {
		T ret = 0;
		for (ll x = i; x > 0; x -= x & (-x)) {
			ret += bt[x];
		}
		return ret;
	}

	void add(ll i, ll w) {
		for (ll x = i; x <= sz; x += x & (-x)) {
			bt[x] += w;
		}
		return;
	}
};



template <typename T>
ll tento(ll N, vector<T> A) {
	vector<pair<T, ll>> p(N + 1);

	repn(i, N) p[i] = { A[i],i };
	sort(++p.begin(), p.end());

	BIT<T> bit(N);
	ll ret = 0;

	repn(i, N) {
		ll t = p[i].second;
		ret += bit.sum(t);
		bit.add(t, 1);
	}

	ret = N * (N - 1) / 2 - ret;
	return ret;
}


int main() {
	ll N;
	cin >> N;
	vvll a(N + 1, vll(4, 0));
	repn(j, 3)repn(i,N)cin >> a[i][j];

	vll c(N + 1);
	vll col(N + 1);

	repn(i, N) {
		ll x = a[i][1];

		if (x % 3 == 1 && a[i][2] == x + 1 && a[i][3] == x + 2) {
			c[i] = (x + 2) / 3;
			col[i] = 0;
		}
		else if (x % 3 == 0 && a[i][2] == x - 1 && a[i][3] == x - 2) {
			c[i] = x / 3;
			col[i] = 1;
		}
		else {
			cout << "No" << endl;
			return 0;
		}

		//cout << col[i] << c[i] << endl;
	}

	repn(i, N) {
		if (c[i] % 2 != i % 2) {
			cout << "No" << endl; return 0;
		}
	}

	vll ev(N / 2 + 1, 0);
	repn(i, N / 2) {
		ev[i] = c[2 * i] / 2;
	}
	ll evsw = tento(N / 2, ev);
	ll evch = 0;
	repn(i, N / 2) {
		evch += col[2 * i];
	}

	
	vll od((N + 1) / 2 + 1, 0);
	repn(i, (N + 1) / 2) {
		od[i] = (c[2 * i - 1] + 1) / 2;
	}
	ll odsw = tento((N + 1) / 2, od);
	ll odch = 0;
	repn(i, (N+1) / 2) {
		odch += col[2 * i - 1];
	}

	//cout << evsw << evch << odsw << odch << endl;

	if (evsw % 2 == odch % 2 && evch % 2 == odsw % 2) { cout << "Yes" << endl; }
	else { cout << "No" << endl; }
	



}


Measured memory_bytes: 14220