A. Launch of Collider (#363 Div.2)

A. Launch of Collider

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

 

There will be a launch of a new, powerful and unusual collider very soon, which located along a straight line. n particles will be launched inside it. All of them are located in a straight line and there can not be two or more particles located in the same point. The coordinates of the particles coincide with the distance in meters from the center of the collider, xi is the coordinate of the i-th particle and its position in the collider at the same time. All coordinates of particle positions are even integers.

You know the direction of each particle movement — it will move to the right or to the left after the collider's launch start. All particles begin to move simultaneously at the time of the collider's launch start. Each particle will move straight to the left or straight to the right with the constant speed of 1 meter per microsecond. The collider is big enough so particles can not leave it in the foreseeable time.

Write the program which finds the moment of the first collision of any two particles of the collider. In other words, find the number of microseconds before the first moment when any two particles are at the same point.

Input

The first line contains the positive integer n (1 ≤ n ≤ 200 000) — the number of particles.

The second line contains n symbols "L" and "R". If the i-th symbol equals "L", then the i-th particle will move to the left, otherwise the i-th symbol equals "R" and the i-th particle will move to the right.

The third line contains the sequence of pairwise distinct even integers x1, x2, ..., xn (0 ≤ xi ≤ 109) — the coordinates of particles in the order from the left to the right. It is guaranteed that the coordinates of particles are given in the increasing order.

Output

In the first line print the only integer — the first moment (in microseconds) when two particles are at the same point and there will be an explosion.

Print the only integer -1, if the collision of particles doesn't happen.

Examples

input

4
RLRL
2 4 6 10

output

1

input

3
LLR
40 50 60

output

-1

Note

In the first sample case the first explosion will happen in 1 microsecond because the particles number 1 and 2 will simultaneously be at the same point with the coordinate 3.

In the second sample case there will be no explosion because there are no particles which will simultaneously be at the same point.

题意：

对撞机的任意地方有带方向的粒子，求最短相遇时间。

注意：粒子位置是成递增排列的，故要想最短必是相邻且左边粒子方向为右，右边粒子方向为左。

附AC代码：

#include<iostream>
#include<cstring>
using namespace std;

const int INF=1<<30;

int a[201000];
char b[201000]; 
int main(){
    int n;
    cin>>n;
    cin>>b;
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    int Min=INF;
    for(int i=0;i<n;i++){
        if(Min>a[i]-a[i-1]&&b[i]=='L'&&b[i-1]=='R')
        Min=a[i]-a[i-1];
    } 
    if(Min!=INF){
        cout<<Min/2<<endl;//对向相遇 
    }
    else
    cout<<"-1"<<endl;
    return 0;
}