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
81
82
83
84
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <cmath>
#include <list>
#include <map>
#include <set>
using namespace std;

typedef long long int LL;
typedef long double LD;
typedef vector<int> VI;
typedef vector<LL> VLL;
typedef vector<LD> VLD;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;

const int INF = 1000000001;
const LD EPS = 10e-9;

#define FOR(x, b, e) for(int x = b; x <= (e); ++x)
#define FORD(x, b, e) for(int x = b; x >= (e); --x)
#define REP(x, n) for(int x = 0; x < (n); ++x)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define MP make_pair
#define PB push_back
#define ST first
#define ND second
#define abs(a) ((a)<0 ? -(a) : (a))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))

const int MAX_M = 1000005;

int n, m;
int c[MAX_M];
char a[MAX_M];

int main()
{
	scanf("%d", &n);
	REP(i, n)
	{
		scanf("%d", &c[i]);
	}
	
	scanf("%d", &m);
	scanf("%s", a);
	
	LL maxT = LL(n)*m + 1;
	int actGamer = 0;
	REP(i, maxT)
	{	
		if(a[i%m] == 'P')
		{
			c[actGamer]--;
		}
		else
		{
			c[actGamer]++;	
		}
		
		//cout << a[i%m] << " " << c[actGamer] << endl;
		
		if(c[actGamer] == 0)
		{
			printf("%d\n", i+1);
			return 0;
		}	
		
		actGamer = (actGamer+1) % n;
	}
	
	printf("-1\n");
	return 0;
}