#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()

int main(){
    int n;
    cin >> n;
    string s, t = "yukicoder";
    cin >> s;
    vector<vector<vector<ll>>> dp(n+1,vector<vector<ll>>(10,vector<ll>(2,0)));
    dp[0][0][0] = 1;
    rep(i,n){
        dp[i+1] = dp[i];
        if(s[i] == '?'){
            rep(j,9) dp[i+1][j+1][1] += dp[i][j][0];
        }else{
            rep(j,9){
                if(s[i] == t[j]){
                    dp[i+1][j+1][0] += dp[i][j][0];
                    dp[i+1][j+1][1] += dp[i][j][1];
                }
            }
        }
        rep(j,20) dp[i+1][j%10][j/10] %= MOD;
    }
    /*rep(i,n+1){
        rep(j,10){
            cout << dp[i][j][0] + dp[i][j][1] << " ";
        }
        cout << endl;
    }*/
    cout << (dp[n][9][0] + dp[n][9][1]) % MOD << endl;
    return 0;
}