#include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <deque>
#define ll long long
using namespace std;
int main()
{
bool found = 0 ;
int n , c = 0;
cin >> n;
string s;
vector<ll> v(n) , v1;
cin >> s;
for(int i = 0 ; i < n ; i++)
cin >> v[i];
for(int i = 0 ; i < n ; i++)
{
if(s[i] == 'R')
{
if(s[i + 1] == 'L')
{
int a = v[i] , b = v[i + 1];
found = 1;
v1.push_back(((a + b) / 2) - v[i]);
}
else
continue;
}
else
continue;
}
if(found)
cout << *min_element(v1.begin(), v1.end()) << '\n';
else
cout << -1 << '\n';
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8Y21hdGg+CiNpbmNsdWRlIDxhbGdvcml0aG0+CiNpbmNsdWRlIDxzdHJpbmc+CiNpbmNsdWRlIDx2ZWN0b3I+CiNpbmNsdWRlIDxkZXF1ZT4KI2RlZmluZSBsbCBsb25nIGxvbmcKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKaW50IG1haW4oKQp7CiAgICBib29sIGZvdW5kID0gMCA7CiAgICBpbnQgbiAsIGMgPSAwOwogICAgY2luID4+IG47CiAgICBzdHJpbmcgczsKICAgIHZlY3RvcjxsbD4gdihuKSAsIHYxOwogICAgY2luID4+IHM7CiAgICBmb3IoaW50IGkgPSAwIDsgaSA8IG4gOyBpKyspCiAgICAgICAgY2luID4+IHZbaV07CiAgICBmb3IoaW50IGkgPSAwIDsgaSA8IG4gOyBpKyspCiAgICB7CiAgICAgICAgaWYoc1tpXSA9PSAnUicpCiAgICAgICAgewogICAgICAgICAgICBpZihzW2kgKyAxXSA9PSAnTCcpCiAgICAgICAgICAgIHsKICAgICAgICAgICAgICAgIGludCBhID0gdltpXSAsIGIgPSB2W2kgKyAxXTsKICAgICAgICAgICAgICAgIGZvdW5kID0gMTsKICAgICAgICAgICAgICAgIHYxLnB1c2hfYmFjaygoKGEgKyBiKSAvIDIpIC0gdltpXSk7CiAgICAgICAgICAgIH0KICAgICAgICAgICAgZWxzZQogICAgICAgICAgICAgICAgY29udGludWU7CiAgICAgICAgfQogICAgICAgIGVsc2UKICAgICAgICAgICAgY29udGludWU7CiAgICB9CiAgICBpZihmb3VuZCkKICAgICAgICBjb3V0IDw8ICptaW5fZWxlbWVudCh2MS5iZWdpbigpLCB2MS5lbmQoKSkgPDwgJ1xuJzsKICAgIGVsc2UKICAgICAgICBjb3V0IDw8IC0xIDw8ICdcbic7Cn0KCg==