// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")


#include<bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = V<VV<T>>;
template<class T> using VVVV = VV<VV<T>>;
#define rep(i,n) for(ll i=0ll;(i)<(n);(i)++)
#define REP(i,a,n) for(ll i=(a);(i)<(n);(i)++)
#define rrep(i,n) for(ll i=(n)-1;(i)>=(0ll);(i)--)
#define RREP(i,a,n) for(ll i=(n)-1;(i)>=(a);(i)--)
const long long INF = (1LL << 60);
const long long mod99 = 998244353;
const long long mod107 = 1000000007;
const long long mod = mod99;
#define eb emplace_back
#define be(v) (v).begin(),(v).end()
#define all(v) (v).begin(),(v).end()
#define foa(i,v) for(auto& (i) : (v))
#define UQ(v) sort(be(v)), (v).erase(unique(be(v)), (v).end())
#define UQ2(v,cmp) sort(be(v)), (v).erase(unique(be(v),cmp), (v).end())
#define UQ3(v,cmp) sort(be(v),cmp), (v).erase(unique(be(v)), (v).end())
#define UQ4(v,cmp,cmp2) sort(be(v), cmp), (v).erase(unique(be(v),cmp2), (v).end())
#define LB(x,v) (lower_bound(be(v),(x))-(v).begin())
#define LB2(x,v,cmp) (lower_bound(be(v),(x),(cmp))-(v).begin())
#define UB(x,v) (upper_bound(be(v),(x))-(v).begin())
#define UB2(x,v,cmp) (upper_bound(be(v),(x),(cmp))-(v).begin())
#define dout()  cout << fixed << setprecision(20)
#define randinit() srand((unsigned)time(NULL))

template<class T, class U> bool chmin(T& t, const U& u) { if (t > u){ t = u; return 1;} return 0; }
template<class T, class U> bool chmax(T& t, const U& u) { if (t < u){ t = u; return 1;} return 0; }


ll Rnd(ll L=0, ll R=mod99){return rand()%(R-L)+L;}


template <typename T, T (*OP)(T, T), T (*E)()>
struct segtree { 
    vector<T> seg;
    int seg_size, _n;//葉の数
    
    segtree(int N) : seg(4*N, E()), seg_size(), _n(N) {
        seg_size = 1;
        while(seg_size < N) seg_size *= 2;
    }
    segtree(const vector<T> a) : seg(4*a.size(), E()), seg_size(), _n(a.size()) {
        int N = a.size();
        seg_size = 1;
        while(seg_size < N) seg_size *= 2;
        for(int i=0; i<N; i++) seg[i + seg_size - 1] = a[i];
        for(int i = seg_size-2; i >= 0; i --){
            seg[i] = OP(seg[2*i + 1], seg[2*i + 2]);
        }
    }
    
    void set(int idx, T x){
        idx += seg_size - 1;
        seg[idx] = x;
        
        while(idx > 0){
            idx = (idx - 1) / 2;
            seg[idx] = OP(seg[2*idx + 1], seg[2*idx + 2]);
        }
    }
    T get(int idx){
        idx += seg_size - 1;
        return seg[idx];
    }
    
    void apply(int idx, T x){
        idx += seg_size - 1;
        seg[idx] = OP(seg[idx], x);
        
        while(idx > 0){
            idx = (idx - 1) / 2;
            seg[idx] = OP(seg[2*idx + 1], seg[2*idx + 2]);
        }
    }
    
    
    T prod(int a, int b) { return prod_sub(a, b, 0, 0, seg_size); }
    T prod_sub(int a, int b, int idx, int left, int right){
        if(a >= right || b <= left) return E();
        if(a <= left && b >= right) return seg[idx];
        
        T v1 = prod_sub(a, b, 2 * idx + 1, left, (left + right) / 2);
        T v2 = prod_sub(a, b, 2 * idx + 2, (left + right) / 2, right);
        return OP(v1, v2);
    }
    T all_prod(){ return seg[0]; }
};

ll e(){return INF;}
ll op(ll L, ll R){return min(L, R);}


void solve(){
    ll n;
    string s;
    ll r,m;
    cin >> n >> s >> r >> m;
    if(n%2){
        cout << -1 << endl;
        return;
    }
    reverse(be(s));
    for(auto&c:s) c = '('+')'-c;
    
    s += s;
    V<ll> v(2*n+10, 0);
    rep(i,2*n){
        v[i+1] = v[i];
        if(s[i] == '(') v[i+1] ++;
        else v[i+1]--;
    }
    segtree<ll, op, e> seg(v);
    ll ans = INF;
    
    rep(i,n){
        ll top = v[i];
        ll back = v[i+n];
        ll mn = seg.prod(i, i+n);
        if((top-mn)%2) chmin(ans, i*r + (top-mn+1)/2*m + (back-mn+1)/2*m);
        else chmin(ans, i*r + (top-mn)/2*m + (back-mn)/2*m);
    }
    cout << ans << endl;
    
    
    
}





int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int t=1;
    // cin >> t;
    rep(i,t) solve();
}