#include <bits/stdc++.h>

#define endl "\n"
#define x first
#define y second
#define pb(a) push_back(a);
#define mst(a, x) memset(a, x, sizeof a)
#define all(a) a.begin(), a.end()
#define complete_unique(a) a.erase(unique(a.begin(), a.end()), a.end())

using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;

const int INF = 0x3f3f3f3f, MOD = 1e9 + 7;

void solve() {
  unordered_set<int> S;
  int T, n, m;
  cin >> T;
  cin >> n;
  int s = 0;
  for (int i = 0; i < n; i++) {
    int a;
    cin >> a;
    s += a;
    S.insert(s);
  }
  cin >> m;
  s = 0;
  for (int i = 0; i < m; i++) {
    int a;
    cin >> a;
    s += a;
    S.insert(s);
  }

  cout << T - S.size() << endl;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  // cout.tie(nullptr);
  int T = 1;
  // cin >> T;
  while (T--) solve();

  return 0;
}