// Copyright (C) 2017 __debug.

// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; version 3

// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with this program; If not, see <http://www.gnu.org/licenses/>.


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>

#define x first
#define y second
#define MP std::make_pair
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define DEBUG(...) fprintf(stderr, __VA_ARGS__)
#ifdef __linux__
#define getchar getchar_unlocked
#define putchar putchar_unlocked
#endif

using std::pair;
using std::vector;
using std::string;

typedef long long LL;
typedef pair<int, int> Pii;

const int oo = 0x3f3f3f3f;

template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, true : false; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, true : false; }
string procStatus()
{
    std::ifstream t("/proc/self/status");
    return string(std::istreambuf_iterator<char>(t), std::istreambuf_iterator<char>());
}
template<typename T> T read(T &x)
{
    int f = 1;
    char ch = getchar();
    for (; !isdigit(ch); ch = getchar())
        f = (ch == '-' ? -1 : 1);
    for (x = 0; isdigit(ch); ch = getchar())
        x = 10 * x + ch - '0';
    return x *= f;
}
template<typename T> void write(T x)
{
    if (x == 0) {
        putchar('0');
        return;
    }
    if (x < 0) {
        putchar('-');
        x = -x;
    }
    static char s[20];
    int top = 0;
    for (; x; x /= 10)
        s[++top] = x % 10 + '0';
    while (top)
        putchar(s[top--]);
}
// EOT

const int MAXN = 1e5 + 5;

int N;
int A[MAXN][3];

void input()
{
    read(N);
    for (int i = 0; i < 3; ++i) {
        for (int j = 1; j <= N; ++j) {
            read(A[j][i]);
            --A[j][i];
        }
    }
}

#define DICKERT(x) if (!(x)) { puts("No"); return; }

struct BIT {
    int sum[MAXN];

    void add(int p, int x)
    {
        for (++p; p <= N; p += p & -p) {
            sum[p] += x;
        }
    }

    int getsum(int p)
    {
        int ret = 0;
        for (++p; p; p -= p & -p) {
            ret += sum[p];
        }
        return ret;
    }
} bit[2];

void solve()
{
    int rev[2] = {0}, flip[2] = {0};

    for (int i = 1; i <= N; ++i) {
        DICKERT((A[i][0] / 3 + 1 & 1) == (i & 1));
        DICKERT(A[i][0] / 3 == A[i][1] / 3 && A[i][1] / 3 == A[i][2] / 3);
        DICKERT((A[i][0] % 3 == 0 && A[i][1] % 3 == 1 && A[i][2] % 3 == 2)
                || (A[i][0] % 3 == 2 && A[i][1] % 3 == 1 && A[i][2] % 3 == 0));

        rev[i & 1] ^= ((i - 1) / 2 - bit[i & 1].getsum(A[i][0] / 3)) & 1;
        bit[i & 1].add(A[i][0] / 3, 1);

        flip[i & 1] ^= (A[i][0] % 3 == 2);
    }

    DICKERT(rev[0] == flip[1]);
    DICKERT(rev[1] == flip[0]);

    puts("Yes");
}

int main()
{
#ifdef __DEBUG
    freopen("E.in", "r", stdin);
    freopen("E.out", "w", stdout);
#endif

    input();
    solve();

    return 0;
}

// _(:3 」∠)_


Measured memory_bytes: 2176