#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
ifstream in_file("minta/be1.txt");
#define input in_file
#define INTHENAMEOFGOD
#else
#define input cin
#define INTHENAMEOFGOD \
    ios::sync_with_stdio(0); \
    cin.tie(0); \
    cout.tie(0);
#endif
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<bool> vb;
typedef pair<ll, ll> pii;
typedef array<ll, 3> pt;

ll N, x;
vector<pt> ps, points, sp;
set<pt> l;
map<pt, bool> m;
set<int> ax;

void dfs(pt x) {
    m[x] = true;
    for (int axis : ax) {
        pt next = x;
        next[axis]++;
        if (l.count(next) && !m[next]) {
            dfs(next);
        }
        next[axis] -= 2;
        if (l.count(next) && !m[next]) {
            dfs(next);
        }
    }
}

void validate_layer(int i) {
    ax = {0, 1, 2};
    ax.erase(i);
    m.clear();
    dfs(*l.begin());
    for (pt p : l) {
        if (!m[p]) {
            cout << "NO\n";
            exit(0);
        }
    }

    sp.clear();
    for (pt p : l) {
        sp.push_back(p);
    }

    int a = *ax.begin();
    int b = *++ax.begin();
    for (int i = 0; i < 2; i++) {
        sort(sp.begin(), sp.end(), [&](pt l, pt r) {
            if (l[a] == r[a])
                return l[b] < r[b];
            return l[a] < r[a];
        });

        ll row = -1;
        pt last;
        for (pt p : sp) {
            if (p[a] != row)
                row = p[a];
            else if (p[b] != last[b]+1) {
                cout << "NO\n";
                exit(0);
            }
            last = p;
        }

        int c = a;
        a = b;
        b = c;
    }
}

void dfs3d(pt x) {
    m[x] = true;
    for (int axis : ax) {
        pt next = x;
        next[axis]++;
        if (l.count(next) && !m[next])
            dfs3d(next);
        next[axis] -= 2;
        if (l.count(next) && !m[next])
            dfs3d(next);
    }
}

int main() {
    INTHENAMEOFGOD
    input >> N;
    points.resize(N);
    ps.resize(N);
    for (ll n = 0; n < N; n++) {
        input >> x;
        points[n][0] = x;
    }
    for (ll n = 0; n < N; n++) {
        input >> x;
        points[n][1] = x;
    }
    for (ll n = 0; n < N; n++){
        input >> x;
        points[n][2] = x;
    }
    for (pt p : points)
        l.insert(p);
    ax = {0, 1, 2};
    dfs3d(points[0]);
    for (pt p : points) {
        if (!m[p]) {
            cout << "NO\n";
            exit(0);
        }
    }
    l.clear();
    
    for (int i = 0; i < 3; i++) {
        copy_n(points.begin(), N, ps.begin());
        sort(ps.begin(), ps.end(), [&](pt a, pt b) {
            return a[i] < b[i];
        });
        ll layer = ps[0][i];
        l.clear();
        for (pt p : ps) {
            if (p[i] != layer) {
                validate_layer(i);
                layer = p[i];
                l.clear();
            }
            l.insert(p);
        }
        validate_layer(i);
    }
    cout << "YES\n";
}