#include <set>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
typedef long long ll ;
#define rep(i, a, b) for (int i = a; i <= b; ++ i) 
const int N = 1e5 + 5 ;
using namespace std ;
int cnt, n, a[4][N], d[5], b[N], bit[N], c[N], ind[N], outd[N] ; bool vis[N] ;
struct poi {
	int l, r ;
} p[N] ;
set <int> S ;
void put(int x) { for ( ; x <= n ; x += x & (- x)) ++ bit[x] ; }
int get(int x) { int res = 0 ; for ( ; x ; x -= x & (- x)) res += bit[x] ; return res ; }
bool cmp(poi a, poi b) {
	return a.r < b.r ;
}
int main() {
	scanf("%d", &n) ;
	rep(i, 1, 3) rep(j, 1, n) scanf("%d", &a[i][j]) ;
	rep(j, 1, n) {
		rep(i, 1, 3) d[i] = a[i][j] ;
		sort(d + 1, d + 4) ;
		if (d[1] % 3 != 1 || d[2] != d[1] + 1 || d[3] != d[2] + 1 || d[2] != a[2][j] || vis[d[1] / 3]) {
			printf("No\n") ;
			return 0 ; 
		}
		vis[d[1] / 3] = true ;
		b[d[1] / 3 + 1] = j, c[j] = d[1] / 3 + 1 ;
		if ((c[j] - j) % 2) {
			printf("No\n") ;
			return 0 ;
		}
	}
/*	rep(i, 1, n) bit[i] = 0 ;
	for (int i = n; i; -- i) {
		if (i & 1) {
			put(c[i]) ;
			continue ;
		}
		if (((get(i) + abs(b[i] - i) / 2) & 1) ^ (a[1][b[i]] > a[3][b[i]])) {
			printf("No\n") ;
			return 0 ;
		}
	}
	rep(i, 1, n) bit[i] = 0 ;
	for (int i = n; i; -- i) {
		cout << i << endl ;
		if (i & 1) {
			if (((get(i) + abs(b[i] - i) / 2) & 1) ^ (a[1][b[i]] > a[3][b[i]])) {
				printf("No\n") ;
				return 0 ;
			}
		} else put(c[i]) ;
	}
*/
	rep(i, 1, n) {
		if (c[i] < i) ++ outd[i - 1], -- outd[c[i] - 1] ; else
		  ++ ind[i + 1], -- ind[c[i] + 1] ;
	}
	rep(i, 1, n) ind[i] += ind[i - 2] ;
	for (int i = n; i; -- i) outd[i] += outd[i + 2] ;
	rep(i, 1, n) if (ind[i] != outd[i]) {
		printf("No\n") ;
		return 0 ;
	}
	cnt = 0 ; 
	rep(i, 1, n) if (i & 1) {
/*		if (ind[i] & 1) ++ cnt ;
//		if (ind[i] & 1) S.insert(i) ;
		if (((abs(c[i] - i) / 2) & 1) ^ (a[3][i] < a[1][i])) ; else continue ;
		++ cnt ; */
		cnt += a[3][i] < a[1][i] ;
//		p[cnt].l = min(c[i], i), p[cnt].r = max(c[i], i) ;
	} else {
		cnt += get(n - c[i] + 1) & 1 ;
		put(n - c[i] + 1) ;
	}
	if (cnt & 1) {
		printf("No\n") ;
		return 0 ; 
	}
	rep(i, 1, n) bit[i] = 0 ;
//	sort(p + 1, p + cnt + 1, cmp) ;
//	rep(i, 1, n) cout << c[i] << " " ; cout << endl ;
/*	rep(i, 1, cnt) {
		std :: set <int> :: iterator it = S.lower_bound(p[i].l) ;
		if (it == S.end() || (*it) > p[i].r) {
			S.insert(p[i].r) ;
		} else {
			S.erase(it) ;
		}
	}
	if (!S.empty()) {
		printf("No\n") ;
		return 0 ; 
	}*/
/*	if (cnt & 1) {
		printf("No\n") ;
		return 0 ;
	}
	cnt = 0 ;
*/	
	cnt = 0 ;
	rep(i, 1, n) if (i & 1) cnt += get(n - c[i] + 1) & 1, put(n - c[i] + 1) ; else {
/*		if (ind[i] & 1) ++ cnt ;
//		if (ind[i] & 1) S.insert(i) ;
		if (((abs(c[i] - i) / 2) & 1) ^ (a[3][i] < a[1][i])) ; else continue ;
		++ cnt ;
*///		p[cnt].l = min(c[i], i), p[cnt].r = max(c[i], i) ;
		cnt += a[3][i] < a[1][i] ;
	}  
	if (cnt & 1) {
		printf("No\n") ;
		return 0 ; 
	}
//	sort(p + 1, p + cnt + 1, cmp) ;
//	rep(i, 1, cnt) cout << p[i].l << " " << p[i].r << endl ;
//	rep(i, 1, n) if (i & 1) ; else printf("%d ", ind[i]) ; cout << endl ;
/*	rep(i, 1, cnt) {
		std :: set <int> :: iterator it = S.lower_bound(p[i].l) ;
		if (it == S.end() || (*it) > p[i].r) {
			S.insert(p[i].r) ;
		} else {
			S.erase(it) ;
		}
	}
	if (!S.empty()) {
		printf("No\n") ;
		return 0 ;
	}
*/
	
	printf("Yes\n") ;
	return 0 ; 
}
#include<bits/stdc++.h>

typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef double lf;
typedef long double llf;
typedef std::pair<int,int> pii;

#define xx first
#define yy second

template<typename T> inline T max(T a,T b){return a>b?a:b;}
template<typename T> inline T min(T a,T b){return a<b?a:b;}
template<typename T> inline T abs(T a){return a>0?a:-a;}
template<typename T> inline bool repr(T &a,T b){return a<b?a=b,1:0;}
template<typename T> inline bool repl(T &a,T b){return a>b?a=b,1:0;}
template<typename T> inline T gcd(T a,T b){T t;if(a<b){while(a){t=a;a=b%a;b=t;}return b;}else{while(b){t=b;b=a%b;a=t;}return a;}}
template<typename T> inline T sqr(T x){return x*x;}
#define mp(a,b) std::make_pair(a,b)
#define pb push_back
#define I inline
#define mset(a,b) memset(a,b,sizeof(a))
#define mcpy(a,b) memcpy(a,b,sizeof(a))

#define fo0(i,n) for(int i=0,i##end=n;i<i##end;i++)
#define fo1(i,n) for(int i=1,i##end=n;i<=i##end;i++)
#define fo(i,a,b) for(int i=a,i##end=b;i<=i##end;i++)
#define fd0(i,n) for(int i=(n)-1;~i;i--)
#define fd1(i,n) for(int i=n;i;i--)
#define fd(i,a,b) for(int i=a,i##end=b;i>=i##end;i--)
#define foe(i,x)for(__typeof((x).end())i=(x).begin();i!=(x).end();++i)

struct Cg{I char operator()(){return getchar();}};
struct Cp{I void operator()(char x){putchar(x);}};
#define OP operator
#define RT return *this;
#define RX x=0;char t=P();while((t<'0'||t>'9')&&t!='-')t=P();bool f=0;\
if(t=='-')t=P(),f=1;x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'
#define RL if(t=='.'){lf u=0.1;for(t=P();t>='0'&&t<='9';t=P(),u*=0.1)x+=u*(t-'0');}if(f)x=-x
#define RU x=0;char t=P();while(t<'0'||t>'9')t=P();x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'
#define TR *this,x;return x;
I bool IS(char x){return x==10||x==13||x==' ';}template<typename T>struct Fr{T P;I Fr&OP,(int&x)
{RX;if(f)x=-x;RT}I OP int(){int x;TR}I Fr&OP,(ll &x){RX;if(f)x=-x;RT}I OP ll(){ll x;TR}I Fr&OP,(char&x)
{for(x=P();IS(x);x=P());RT}I OP char(){char x;TR}I Fr&OP,(char*x){char t=P();for(;IS(t);t=P());if(~t){for(;!IS
(t)&&~t;t=P())*x++=t;}*x++=0;RT}I Fr&OP,(lf&x){RX;RL;RT}I OP lf(){lf x;TR}I Fr&OP,(llf&x){RX;RL;RT}I OP llf()
{llf x;TR}I Fr&OP,(uint&x){RU;RT}I OP uint(){uint x;TR}I Fr&OP,(ull&x){RU;RT}I OP ull(){ull x;TR}};Fr<Cg>in;
#define WI(S) if(x){if(x<0)P('-'),x=-x;char s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')
#define WL if(y){lf t=0.5;for(int i=y;i--;)t*=0.1;if(x>=0)x+=t;else x-=t,P('-');*this,(ll)(abs(x));P('.');if(x<0)\
x=-x;while(y--){x*=10;x-=floor(x*0.1)*10;P(((int)x)%10+'0');}}else if(x>=0)*this,(ll)(x+0.5);else *this,(ll)(x-0.5);
#define WU(S) if(x){char s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')
template<typename T>struct Fw{T P;I Fw&OP,(int x){WI(10);RT}I Fw&OP()(int x){WI(10);RT}I Fw&OP,(uint x){WU(10);RT}
I Fw&OP()(uint x){WU(10);RT}I Fw&OP,(ll x){WI(19);RT}I Fw&OP()(ll x){WI(19);RT}I Fw&OP,(ull x){WU(20);RT}I Fw&OP()
(ull x){WU(20);RT}I Fw&OP,(char x){P(x);RT}I Fw&OP()(char x){P(x);RT}I Fw&OP,(const char*x){while(*x)P(*x++);RT}
I Fw&OP()(const char*x){while(*x)P(*x++);RT}I Fw&OP()(lf x,int y){WL;RT}I Fw&OP()(llf x,int y){WL;RT}};Fw<Cp>out;

const int N=100007;

int n,t[N][3],s[N];

int main()
{
	in,n;
	fo0(l,3)fo1(i,n)in,t[i][l];
	fo1(i,n)
	{
		int p=(t[i][0]-1)/3;
		//out,p,'\n';
		bool f1=1,f2=1;
		fo0(j,3)f1&=t[i][j]==p*3+j+1;
		fo0(j,3)f2&=t[i][j]==p*3+3-j;
		if((!f1&&!f2)||(~(i^p)&1))return puts("No"),0;
		s[i]=f1?p+1:-p-1;
	}
	//fo1(i,n)out,s[i],' ';out,'\n';
	int a[2]={0,0},b[2]={0,0};
	fo1(i,n)a[i&1]^=s[i]<0;
	fo1(i,n)while(abs(s[i])!=i)std::swap(s[i],s[abs(s[i])]),b[i&1]^=1;
	out,a[0]==b[1]&&a[1]==b[0]?"Yes":"No",'\n';
}