#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int,int> P;

#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();;++(it)) {if ((it) == map.end()) {cout << "}\n";break;}else cout << "" << (it)->first << "=>" << (it)->second << ", ";}}while(0)

template<typename T1,typename T2>ostream& operator<<(ostream& os,const pair<T1,T2>& a) {os << "(" << a.first << ", " << a.second << ")";return os;}

const char newl = '\n';

int main() {
    int n;
    string s;
    multiset<ll> st;
    cin >> n >> s;
    vector<ll> a(n+1,0);
    for (int i = 0;i < n;++i) cin >> a[i+1];
    for (int i = 0;i < n;++i) if (s[i] == 'R') a[i+1] *= -1;
    for (int i = 0;i < n;++i) a[i+1] += a[i];
    for (int i = 0;i < n+1;++i) st.insert(a[i]);
    ll ans = 0;
    for (int i = 0;i < n;++i) {
        ans = max(ans,abs(*st.begin()-a[i]));
        ans = max(ans,abs(*prev(st.end())-a[i]));
        st.erase(st.find(a[i]));
    }
    cout << ans << newl;
}