#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cout << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cout<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 200010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = 1 << 29;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
///////////////////////////////////////////////////////////////////////////////////////////////////

int N;
int A[3][MAX_N];
int B[MAX_N];
bool used[3];
ll op = 0, ep = 0;

struct BIT { //0-origin!!! update and get just like lazy_segtree
	int n; vl bit0, bit1;
	void init(int mx) {
		n = mx;
		bit0 = vl(n + 1, 0); bit1 = vl(n + 1, 0);
	}
	BIT(int mx = 0) { init(mx); } 

	ll ga(vl& bit, int i) {
		ll s = 0;
		while(i > 0) { s += bit[i]; i -= i & -i; }
		return s;
	}
	void app(vl& bit, int i, ll x) {
		while(i <= n) { bit[i] += x; i += i & -i; }
	}
	void update(int a, int b, ll x) { //[a, b)
		a++;
		app(bit0, a, -x * (a - 1));
		app(bit1, a, x);
		app(bit0, b + 1, x * b);
		app(bit1, b + 1, -x);
	}
	ll get(int a, int b) { //[a, b)
		a++;
		return (ga(bit1, b) * b + ga(bit0, b)) 
			- (ga(bit1, a - 1) * (a - 1) + ga(bit0, a - 1));
	}
};

ll parity(const vector<int>& vec) {
	int n = sz(vec);
	vector<int> rev(n, 0);
	rep(i, 0, n) {
		rev[vec[i]] = i;
	}
	BIT bit(n);
	ll res = 0;
	rep(i, 0, n) {
		res += (rev[i] - bit.get(0, rev[i]));
		bit.update(rev[i], rev[i] + 1, 1);
	}
	return res;
}

void solve() {
	cin >> N;
	rep(i, 0, 3) {
		rep(j, 0, N) {
			cin >> A[i][j];
			A[i][j]--;
		}
	}
	rep(j, 0, N) {
		int at = -1, num = -1;
		rep(i, 0, 3) {
			if(A[i][j] % 3 == 0) {
				at = i;
				num = A[i][j] / 3;
				B[j] = num;
			}
		}
		rep(i, 0, 3) {
			if(A[i][j] < num * 3 || num * 3 + 3 <= A[i][j]) {
				cout << "No\n"; return;
			}
		}
		if(A[1][j] != num * 3 + 1) {
			cout << "No\n";
			return;
		}
		if((num - j) % 2) {
			cout << "No\n"; return;
		}
		else {
			int v = ((at == 2) ^ ((abs(num - j) / 2) % 2));
			if(j % 2) op += v;
			else ep += v;
		}
	}
	vector<int> odd, even;
	rep(i, 0, N) {
		if(i % 2) {
			odd.pb(B[i] / 2);
		}
		else {
			even.pb(B[i] / 2);
		}
	}
	// debug(even, odd, vi(B, B + N));
	// debug(parity(even), parity(odd));
	op += parity(even);
	ep += parity(odd);
	if(op % 2 == 0 && ep % 2== 0) {
		cout << "Yes\n";
	}
	else cout << "No\n";
}

int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
	srand((unsigned int)time(NULL));
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
    freopen("in.txt", "rt", stdin);
#endif	
	solve();
#ifdef LOCAL
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
	return 0;
}



Measured memory_bytes: 3196