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
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.text.DecimalFormat;
import java.text.NumberFormat;
import java.util.Collections;
import java.util.Comparator;
import java.util.Scanner;
import java.util.Vector;

public class haz {

	private static int skipWhitespace(final InputStream in) throws IOException {
		int val = -1;
		while ((val = in.read()) != -1) {
			if (!Character.isWhitespace((char) val))
				break;
		}

		return val;
	}

	private static int readInt(final InputStream in) {
		final StringBuilder b = new StringBuilder();
		try {
			int val = skipWhitespace(in);
			b.append((char) val);
			while ((val = in.read()) != -1) {
				if (Character.isWhitespace((char) val))
					break;
				b.append((char) val);
			}
			return Integer.parseInt(b.toString());
		} catch (final IOException e) {
			throw new RuntimeException(e);
		}
	}

	public void run(final InputStream in, PrintStream out) {
		int n = readInt(in);
		int[] kol_o = new int[n];
		int[] kol = new int[n];
		for (int i = 0; i < n; i++) {
			kol_o[i] = readInt(in);
			kol[i] = kol_o[i];
		}

		int m = readInt(in);
		byte[] wyg = new byte[m];
		BufferedReader br = new BufferedReader(new InputStreamReader(in));
		char[] swyg = new char[m];
		try {
			br.read(swyg, 0, m);
		} catch (Exception e) {
			System.out.println(swyg + e.getMessage());
		}

		int p = 0;
		int w = 0;
		for (int i = 0; i < m; i++) {
			if (swyg[i] == 'W') {
				wyg[i] = (byte) 1;
				w++;
			} else {
				wyg[i] = (byte) -1;
				p++;
			}
		}

		long count = 0;
		int l = 0;
		long cykl = -1;
		boolean licz = true;
		boolean znal = false;
		while (licz) {
   		    cykl++;
			for (int k = 0; k < n; k++) {
				if (l == 0 && k == 0 && cykl > 0) {
					licz = false;
					break;
				}
				kol[k] += wyg[l];
				count++;
				if (kol[k] == 0) {
					out.print(count + "\n");
					licz = false;
					znal = true;
					break;
				}
				l++;
				if (l == m) {
					l = 0;
				}
			}
		}
		if (!znal) {
			int[] diff = new int[n];
			int MAX = 0;
			int max = MAX;
			for (int i = 0; i < n; i++) {
				diff[i] = kol_o[i] - kol[i];
				if (diff[i] > 0 && diff[i] > max ) {
					max = diff[i];
				}
			}

			if (max == MAX) {
				out.print("-1\n");
			} else {
				int res = Integer.MAX_VALUE;
				for (int i = 0; i < n; i++) {
					if (diff[i] > 0) {
						int mnoznik = (kol_o[i] / diff[i]) - 1;
						if (mnoznik < res) {
							res = mnoznik;
						}
					}
				}
				
				for (int i = 0; i < n; i++) {
					kol[i] = kol_o[i] - diff[i] * res;
				}

				licz = true;
				count = 0;
				while (licz) {
					for (int k = 0; k < n; k++) {
						kol[k] += wyg[l];
						count++;
						if (kol[k] == 0) {
							NumberFormat formatter = new DecimalFormat("#0");
							double z = n * cykl * res + count;
							out.print(formatter.format(z) + "\n");
							licz = false;
							break;
						}
						l++;
						if (l == m) {
							l = 0;
						}
					}
				}
			}
		}
	}

	public static void main(final String[] args) {
		new haz().run(System.in, System.out);
	}

}