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
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
#include<cstdio>
#include<algorithm>
#include<vector>
#include<cstring>
#include<set>
#include<assert.h>
using namespace std;
#define FOR(i,a,b) for(int i = a; i <= b; ++i)
#define FORD(i,a,b) for(int i = a; i >= b; --i)
#define REP(i,n) FOR(i,0,(n)-1)
#define RI(i,n) FOR(i,1,n)
#define pb push_back
#define mp make_pair
#define st first
#define nd second
#define mini(a,b) a=min(a,b)
#define maxi(a,b) a=max(a,b)
bool debug;
typedef vector<int> vi;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
const ll inf = 2000000000000000000LL;
const int nax = 1e6 + 5;
const int czapa = 2097152;

struct dane{
  dane(int s=0, int p=0) {
    suma = s;
    min_pref = p;
  }
  int suma, min_pref;
};

char znak;
ll ile,kroki,n,m,d,okres;
ll t[nax];
int w[nax];
ll wyn[nax];
dane drzewo[2 * czapa];

ll nwd(ll a, ll b) {
  return a ? nwd(b%a, a) : b;
}

void insert(int p, int v) {
  //printf("wstawiam na polu %d wartosc %d\n", p, v);
  p += czapa;
  drzewo[p].suma = v;
  drzewo[p].min_pref = v > 0 ? 0 : v;
  
  p /= 2;
  while (p) {
    drzewo[p].suma = drzewo[p*2].suma + drzewo[p*2 + 1].suma;
    drzewo[p].min_pref = min(drzewo[2*p].min_pref, drzewo[2*p].suma + drzewo[2*p+1].min_pref);
    p /= 2;
  } 
}

int query(int p, int val) {
  if (p >= czapa) return p - czapa;
  if (val <= -drzewo[2*p].min_pref) 
    return query(2*p, val);
  return query(2*p+1, val + drzewo[2*p].suma);
}

void badaj(int p) {
  //printf("badam %d\n",p);
  REP(i,ile) {
    insert(i, w[(okres * ll(i) + p) % m]);
  }
  int dupa = 0;
  int ost_poz = ile - 1;
  int suma = drzewo[1].suma;
  //printf("suma %d\n",suma);
  REP(i, ile) {
    int pomp = p;
    while (pomp < n) {
      wyn[pomp] = inf;
      if (suma < 0 || t[pomp] < -drzewo[1].min_pref) {
        int k = 0;
        if (suma < 0) k = max(0LL, (t[pomp] + drzewo[1].min_pref - suma - 1) / -suma);
        int x = query(1, t[pomp] + k * suma) - dupa + 1;
        //printf("dla poz %d i wartosci %lld mam k rowne %d x rowne %d\n",p,t[p],k,x);
        wyn[pomp] = kroki * k + n * ll(x - 1) + pomp + 1;
        //if (wyn[pomp] < 0) printf("dla poz %d i wartosci %lld mam k rowne %d x rowne %d\n",p,t[p],k,x);
      }
      pomp += m;
    }
    //printf("dla pozycji %d wynik to %lld\n",p, wyn[p]);
    
    p += okres;
    p %= m;
    //if (p >= n) break;
    ++dupa;
    ++ost_poz;
    insert(ost_poz, drzewo[ost_poz - ile + czapa].suma);
    insert(ost_poz - ile, 0);
  }
  
  REP(i,ile) insert(ost_poz - i, 0);
}

int main(int argc, char * argv[]) {
	debug = argc > 1;
  scanf("%lld",&n);
  REP(i,n) scanf("%lld",&t[i]);
  scanf("%lld",&m);
  REP(i,m) {
    scanf(" %c",&znak);
    w[i] = znak == 'W' ? 1 : -1;
  }
  //printf("%lld %lld\n",n,m);
  d = nwd(n, m);
  kroki = n * m / d;
  ile = kroki / n;
  
  okres = n % m;
  if (okres == 0) okres = m;
    
  //printf("%lld %lld %lld\n",okres,ile,kroki);  
  REP(i, d) {
    badaj(i);  
    //puts("HOP");
  }
  
  ll res = inf;
  //REP(i,n) printf("%d %lld\n",i,wyn[i]);
  REP(i,n) {
    res = min(res, wyn[i]);
  }
  
  if (res == inf) res = -1;
  printf("%lld\n",res);
	return 0;
}