#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

int main() {
    int n;
    cin >> n;
    vector<int> v(n);
    for (int i = 0; i < 3; ++i) {
        int k;
        cin >> k;
        for (int j = 0; j < k; ++j) {
            int x;
            cin >> x;
            v[x-1] |= (1 << i);
        }
    }
    int ans = 0;
    for (int i = 0; i < n; ++i) {
        for (auto &&j : {4, 6, 7}) if(v[i] == j) ans++;
    }
    cout << ans << "\n";
    return 0;
}
