#include <bits/stdc++.h>
#include <random>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
//#define ll __int128
//#define int ll
//#define int ll
//#define char ll
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;

#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cerr << (#x) << " = " << (x) << endl;

#ifdef MAX_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif

const double PI = 2 * acos(0.0);
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());

const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";


template <class T0, class T1>
inline ostream & operator << (ostream &out, pair<T0, T1> &a) {
    return out << "{" << a.first << ", " << a.second << "}";
}

template <class T0, class T1>
inline istream & operator >> (istream &in, pair<T0, T1> &a) {
    return in >> a.first >> a.second;
}

template <class T0, class T1, class T2>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}

template <class T0, class T1, class T2, class T3>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2, T3> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ", " <<  get<3>(a) << "}";
}

template<class T>
inline ostream & operator << (ostream &out, vector<T> &a) {
    out << "[";
    fori (i, a.size())
        out << a[i] + 1 << vector<string>{", ", "]  "}[i + 1 == a.size()];
    return out;
}


void smain();



signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
#ifdef MAX_HOME
    freopen("input.txt", "r", stdin);
    clock_t start = clock();
#endif
    cout << setprecision(4) << fixed;
    smain();
#ifdef MAX_HOME
    cout << "\n\n\n\nTOTAL EXECUTION TIME: " << float( clock () - start ) /  CLOCKS_PER_SEC << endl;
#endif
    return 0;
}

void out(bool cond) {
    cout << (cond ? "Yes\n" : "No\n");
    exit(0);
}

struct Tree {
    vi t;
    Tree(int n) {
        t.resize(n << 2, 0);
    }

    int get(int v, int tl, int tr, int l, int r) {
        if (l > r)
            return 0;
        if (tl == l && tr == r)
            return t[v];
        int tm = tl + tr >> 1;
        return get(v << 1, tl, tm, l, min(tm, r)) +
               get(v << 1 | 1, tm + 1, tr, max(tm + 1, l), r);
    }

    void upd(int v, int tl, int tr, int pos, int val) {
        if (tl == tr) {
            t[v] = val;
            return;
        }
        int tm = tl + tr >> 1;
        if (pos <= tm)
            upd(v << 1, tl, tm, pos, val);
        else
            upd(v << 1 | 1, tm + 1, tr, pos, val);
        t[v] = t[v << 1] + t[v << 1 | 1];
    }
};

const int N = 3e5 + 10;
bool getinv(vi a) {
    Tree tree(N + 10);
    bool ret = 0;
    for (auto x : a) {
        ret ^= tree.get(1, 0, N, x, N) & 1;
        tree.upd(1, 0, N, x, 1);
    }
    return ret;
}

void smain() {
    int n;
    cin >> n;
    vvi a(3, vi(n));
    fori (z, 3) {
        fori (i, n) {
            cin >> a[z][i];
        }
    }

    vi f, s;
    bool cf = 0, cs = 0;

    for (int i = 0; i < n; ++i) {
        bool inv = a[0][i] == a[1][i] + 1 && a[2][i] == a[1][i] - 1;
        cerr << inv << ' ';
        if (inv) {
            if (a[0][i] != a[1][i] + 1)
                out(false);
            if (a[2][i] != a[1][i] - 1)
                out(false);
        } else {
            if (a[0][i] != a[1][i] - 1)
                out(false);
            if (a[2][i] != a[1][i] + 1)
                out(false);
        }
        int j = min(a[0][i], min(a[1][i], a[2][i]));
        j--;
        if (j % 3)
            out(false);
        j /= 3;
        if ((j & 1) != (i & 1)) {
            out(false);
        }
        if (i & 1) {
            cf ^= inv;
            s.push_back(j);
        } else {
            cs ^= inv;
            f.push_back(j);
        }
    }

    out(cf == getinv(f) && cs == getinv(s));


}

Measured memory_bytes: 7212