#line 2 "header.hpp" //%snippet.set('header')% //%snippet.fold()% #ifndef HEADER_H #define HEADER_H // template version 2.0 using namespace std; #include // varibable settings const long long INF = 1e18; template constexpr T inf = numeric_limits::max() / 2.1; #define _overload3(_1, _2, _3, name, ...) name #define _rep(i, n) repi(i, 0, n) #define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i) #define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__) #define _rrep(i, n) rrepi(i, 0, n) #define rrepi(i, a, b) for (ll i = (ll)((b)-1); i >= (ll)(a); --i) #define r_rep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__) #define each(i, a) for (auto &&i : a) #define all(x) (x).begin(), (x).end() #define sz(x) ((int)(x).size()) #define pb(a) push_back(a) #define mp(a, b) make_pair(a, b) #define mt(...) make_tuple(__VA_ARGS__) #define ub upper_bound #define lb lower_bound #define lpos(A, x) (lower_bound(all(A), x) - A.begin()) #define upos(A, x) (upper_bound(all(A), x) - A.begin()) template inline void chmax(T &a, const T &b) { if ((a) < (b)) (a) = (b); } template inline void chmin(T &a, const T &b) { if ((a) > (b)) (a) = (b); } template auto make_table(X x, T a) { return vector(x, a); } template auto make_table(X x, Y y, Z z, Zs... zs) { auto cont = make_table(y, z, zs...); return vector(x, cont); } #define cdiv(a, b) (((a) + (b)-1) / (b)) #define is_in(x, a, b) ((a) <= (x) && (x) < (b)) #define uni(x) sort(all(x)); x.erase(unique(all(x)), x.end()) #define slice(l, r) substr(l, r - l) typedef long long ll; typedef long double ld; using vl = vector; using vvl = vector; using pll = pair; template using PQ = priority_queue, greater>; void check_input() { assert(cin.eof() == 0); int tmp; cin >> tmp; assert(cin.eof() == 1); } #if defined(PCM) || defined(LOCAL) #else #define dump(...) ; #define dump_1d(...) ; #define dump_2d(...) ; #define cerrendl ; #endif #endif /* HEADER_H */ //%snippet.end()% #line 2 "solve.cpp" template using vec = vector; struct Fast { Fast() { std::cin.tie(0); ios::sync_with_stdio(false); } } fast; int solve() { ll n;cin>>n; vector a(n); rep(i, n) { cin>>a[i]; } sort(all(a)); dump(a); ll m;cin>>m; vector b(m); rep(i, m) { cin>>b[i]; } sort(all(b)); reverse(all(b)); dump(b); vector p(n); iota(all(p), 0LL); ll ans = 20; do{ dump(p); vector ma(a); rep(i, n) ma[i] = a[p[i]]; dump(ma); vec c(b); ll now = 0; bool valid = true; rep(i, n){ if (c[now] >= ma[i]) { c[now] -= ma[i]; } else{ now++; if (now == n || c[now] < ma[i]){ valid = false; break; } c[now] -= ma[i]; } } if (valid) chmin(ans, now+1); } while (next_permutation(all(p))); cout << (ans == 20 ? -1 : ans) << endl; return 0; } int main(){/*{{{*/ solve(); check_input(); return 0; }/*}}}*/