1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
#include<cstdio>
#include<vector>
#include<algorithm>
#include<set>
#include<iostream>


using namespace std;

#define rep(i,n) for(int i=0; i<(int)n; i++)
#define st first
#define nd second
#define mp make_pair
#define pb push_back

typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<pi> vpii;
typedef set<int> SI;

#ifdef DEBUG
const bool debug = true;
#else
const bool debug = false;
#endif
int n, m, k, l, d, a, b;
const int inf = 1000 * 1000 * 1000 ;
const int MAKSN = 1000 * 1000 + 13; // UZUPElnic

long long mini = inf;
long long sum = 0;

vi v;
string s;

void readIn()
{
    cin >> n;
    rep(i, n) {
        cin >> k;
        v.pb(k);
    }

    cin >> m;
    cin >> s;
}

void solve()
{
    long long maks = n*m;

    rep(i, maks) {
        int pos = i % m;
        int kt = i % n;

        if (s[pos] == 'W') {
          v[kt]++;
        } else {
          v[kt]--;
        }


        if(v[kt] <= 0)
        {
          cout << i+1 <<"\n";
          return;
        }

    }

    cout << "-1\n";
}

int main()
{
    ios_base::sync_with_stdio(0);
    readIn();
    solve();
    return 0;
}