#include<iostream>
#include<vector>
#include<string>
#include<map>
#include<queue>
#include<set>
#include<deque>
#include<cmath>
#include<algorithm>
#include<functional>
#include<stack>
#include<tuple>
#include<bitset>
typedef long long ll;
using namespace std;

int main() {
	int n;
	cin >> n;
	vector<bool> used(n + 1);
	used[0] = 1;
	int m1; cin >> m1;
	int pos = 0;
	for (int i = 0; i < m1; i++) {
		int a; cin >> a;
		pos += a;
		used[pos] = true;
	}

	int m2; cin >> m2;
	for (int i = 0; i < m2; i++) {
		int a; cin >> a;
		pos -= a;
		used[pos] = true;
	}

	int ans = 0;
	for (int i = 0; i < n; i++)if (!used[i])ans++;
	cout << ans << endl;
}