#include<iostream>
#include<math.h>
#include<vector>
#include <array>
#include <algorithm>
#include <queue>
#include <numeric>
#include <map>

using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) //printf(__VA_ARGS__)
#define INF ((1<<31) - 1)

typedef pair<int, int> pos;
int pos::*x = &pos::first;
int pos::*y = &pos::second;

int dxy[] = {0, 1, 0, -1, 0};

/*================================*/


int N, M;
int A[20], B[20];

signed main()
{
    cin >> N;
    REP(i, N) cin >> A[i];
    cin >> M;
    REP(i, M) cin >> B[i];
    sort(B, B+M, greater<int>());
    
    int DP[1<<N][2];
    REP(i, 1<<N) DP[i][0] = DP[i][1] = INF;
    DP[0][0] = 0;
    DP[0][1] = 0;
    
    REP(i, 1<<N) {
        REP(j, N) {
            if ((i & 1<<j) == 0) continue;
            // 一つ前の状態は
            int k = (i - (1<<j));
            int w = A[j];
            int index = DP[k][0];
            int used = DP[k][1];
            while (index < M) {
                int remain = B[index] - used;
                if (w <= remain) {
                    // 入った
                    int nextused = used + w;
                    if ((index < DP[i][0]) || (index == DP[i][0] && nextused < DP[i][1])) {
                        // 採用
                        DP[i][0] = index;
                        DP[i][1] = nextused;
                    }
                    break;
                }
                index++;
                used = 0;
            }
        }
    }
    
//    REP(i, 1<<N) cout << std::bitset<5>(i) << " " << DP[i][0] << ',' << DP[i][1] << endl;
    if (DP[(1<<N)-1][0] < INF) {
        cout << DP[(1<<N)-1][0] + 1 << endl;
    } else {
        cout << -1 << endl;
        
    }
    
    return 0;
}