#include<bits/stdc++.h>
#define ll long long
#define For(i,l,r) for(int i=l;i<=r;++i)
#define FOR(i,r,l) for(int i=r;i>=l;--i)
#define inf 0x3f3f3f3f3f3f3f3f
using namespace std;

const int N = 30, M = (1<<25)+1;

int n, m, a[N], b[N];

struct Node {
  ll sum, dp;
  bool vis;
} f[M];

unordered_map<int, bool> mp;

void Num(int x) {
  For(i,0,9) cout << ((x>>i)&1);
  cout << '\n';
}

signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  cin >> m;
  for (int i = 0; i < m; i++) cin >> b[i], mp[b[i]] = 1;
  f[0] = (Node){0, 1, 0};
  for (ll S = 1; S < (1ll << n); S++) {
    for (ll i = 0; i < n; i++) {
      if((S >> i) & 1ll) {
        int nS = S ^ (1ll << i);
        f[S].sum = f[nS].sum + a[i];
        if(mp[f[S].sum]) f[S].vis = 1;
        if(!f[nS].vis) {
          f[S].dp += f[nS].dp;
        }
        // Num(S); Num(nS); cout << f[S].dp << "____---____\n";
      }
    }
  }
  cout << f[(1<<n)-1].dp << '\n';
  return 0;
}