#include <bits/stdc++.h>
#include <atcoder/modint>

using namespace std;
using namespace atcoder;

using mint = modint1000000007;

const vector<int> c{0, 1, 1, 2, 1, 2, 2, 3};

int main()
{
    int64_t n;
    cin >> n;
    string k;
    cin >> k;
    if (n == 0)
    {
        cout << count(k.begin(), k.end(), 'o') << endl;
        return 0;
    }
    mint ans = 0;
    for (int i = 0; i < 8; i++)
    {
        if (k.at(i) == 'o')
        {
            ans += mint(2).pow(2 * n);
            if (n > 1)
            {
                ans += (c[i] * c[i] + (4 - c[i]) * (4 - c[i])) * (mint(2).pow(n - 1) - 1) * mint(2).pow(2 * n - 4);
            }
        }
    }
    ans *= 2;
    cout << ans.val() << endl;
}