#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=1<<30;

map<char,int> MA[3];

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int N,A,B;cin>>N>>A>>B;
    string S;cin>>S;
    vector<int> X;
    int i=0;
    while(i+2<N){
        int j=i;
        while(j+2<N&&S[j]=='c'&&S[j+1]=='o'&&S[j+2]=='n') j+=3;
        if(i==j){
            i++;
            continue;
        }else{
            X.push_back((j-i)/3);
            i=j;
        }
    }
    
    if(A==B){
        int cn=0;
        for(int a:X) cn+=a/A;
        cout<<cn<<endl;
        return 0;
    }
    
    int ans=-1;
    
    {
        bool sw=false;
        if(A<B){
            swap(A,B);
            sw=true;
        }
        
        int left=0,right=N+1;
        while(right-left>1){
            int mid=(left+right)/2;
            int taA,taB;
            taA=(mid+1)/2;
            taB=mid/2;
            if(sw) swap(taA,taB);
            
            priority_queue<pair<int,int>> PQ;
            for(int x:X) PQ.push(mp(x%A,x));
            int cn=0;
            vector<int> Y;
            while(!PQ.empty()){
                if(cn==taB) break;
                auto u=PQ.top();PQ.pop();
                int x=u.se;
                if(x>=B){
                    x-=B;
                    cn++;
                    PQ.push(mp(x%A,x));
                }else{
                    Y.push_back(x);
                }
            }
            if(cn==taB){
                int can=0;
                while(!PQ.empty()){
                    auto u=PQ.top();PQ.pop();
                    int x=u.se;
                    can+=x/A;
                }
                for(int y:Y) can+=y/A;
                if(can>=taA){
                    left=mid;
                }else{
                    right=mid;
                }
            }else{
                right=mid;
            }
        }
        
        if(sw){
            swap(A,B);
        }
        
        chmax(ans,left);
    }
    
    {
        bool sw=false;
        if(A>B){
            swap(A,B);
            sw=true;
        }
        
        int left=0,right=N+1;
        while(right-left>1){
            int mid=(left+right)/2;
            int taA,taB;
            taA=(mid+1)/2;
            taB=mid/2;
            if(sw) swap(taA,taB);
            
            priority_queue<pair<int,int>> PQ;
            for(int x:X) PQ.push(mp(x%A,x));
            int cn=0;
            vector<int> Y;
            while(!PQ.empty()){
                if(cn==taB) break;
                auto u=PQ.top();PQ.pop();
                int x=u.se;
                if(x>=B){
                    x-=B;
                    cn++;
                    PQ.push(mp(x%A,x));
                }else{
                    Y.push_back(x);
                }
            }
            if(cn==taB){
                int can=0;
                while(!PQ.empty()){
                    auto u=PQ.top();PQ.pop();
                    int x=u.se;
                    can+=x/A;
                }
                for(int y:Y) can+=y/A;
                if(can>=taA){
                    left=mid;
                }else{
                    right=mid;
                }
            }else{
                right=mid;
            }
        }
        
        chmax(ans,left);
    }
    
    cout<<ans<<endl;
}