B'Bob is a duck. He wants to get to Alice 's nest, so that those two can duck! The journey can be represented as a straight line, consisting of n segments. Bob is located to the left of the first segment, while Alice 's nest is on the right of the last segment. Each segment has a length in meters, and also terrain type: grass, water or lava. Bob has three movement types: swimming, walking and flying. He can switch between them or change his direction at any point in time (even when he is located at a non-integer coordinate), and doing so doesn 't require any extra time. Bob can swim only on the water, walk only on the grass and fly over any terrain. Flying one meter takes 1 second, swimming one meter takes 3 seconds, and finally walking one meter takes 5 seconds. Bob has a finite amount of energy, called stamina. Swimming and walking is relaxing for him, so he gains 1 stamina for every meter he walks or swims. On the other hand, flying is quite tiring, and he spends 1 stamina for every meter flown. Staying in place does not influence his stamina at all. Of course, his stamina can never become negative. Initially, his stamina is zero. What is the shortest possible time in which he can reach Alice 's nest? The first line contains a single integer n ( 1 <= q n <= q 10^5 ) -- the number of segments of terrain. The second line contains n integers l_1, l_2, ... , l_n ( 1 <= q l_i <= q 10^{12} ). The l_i represents the length of the i -th terrain segment in meters. The third line contains a string s consisting of n characters "G", "W", "L", representing Grass, Water and Lava, respectively. It is guaranteed that the first segment is not Lava. Output a single integer t -- the minimum time Bob needs to reach Alice. In the first sample, Bob first walks 5 meters in 25 seconds. Then he flies the remaining 5 meters in 5 seconds. In the second sample, '...