#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define reps(x, s) for(llint (x) = 0; (x) < (llint)(s).size(); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define ceildiv(x, y) (((x)+(y)-1) / (y))
#define all(x) (x).begin(),(x).end()
#define outl(x) cout << x << endl
#define SP << " " << 
#define inf 1e18
#define mod 1000000007

using namespace std;

typedef long long llint;
typedef long long ll;
typedef pair<llint, llint> P;
bool exceed(ll x, ll y, ll m){return x >= m / y + 1;} 

llint modpow(llint a, llint n)
{
	if(n == 0) return 1;
	if(n % 2){
		return ((a%mod) * (modpow(a, n-1)%mod)) % mod;
	}
	else{
		return modpow((a*a)%mod, n/2) % mod;
	}
}

ll n;
string s;

ll func(ll a, ll b, ll k)
{
	ll ret = 0;
	rep(i, 0, n-1){
		ll p = ((a>>i)&1) | (((b>>i)&1)<<1);
		ret |= ((k>>p)&1) << i;
	}
	return ret;
}

ll get(ll b)
{
	ll ret = 0;
	ret += b * b % mod * modpow(4, n-2) % mod * (modpow(2, n-1) + mod - 1) % mod, ret %= mod;
	ret += mod - (4-b) * b % mod * modpow(4, n-2) % mod * (modpow(2, n-1) + mod - 1) % mod, ret %= mod;
	ret += b * modpow(4, n-1) % mod * modpow(2, n-1) % mod, ret %= mod;
	
	return ret;
}

ll calc(ll k)
{
	if(n <= 5){
		ll N = 1<<n, ret = 0;
		rep(p, 0, N-1) rep(q, 0, N-1) rep(r, 0, N-1){
			if((func(p, q, k) - r) * (func(p, q, 15-k) - r) <= 0) ret++;
		}
		return ret;
	}
	
	ll b = 0;
	rep(i, 0, 3) if(k & (1<<i)) b++;
	
	ll ret = get(b);
	ret += get(4-b), ret %= mod;
	ret += modpow(4, n), ret %= mod;
	return ret;
}

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> s;
	ll ans = 0;
	rep(i, 0, 7){
		if(s[i] == 'o') ans += calc(i), ans %= mod;
	}
	cout << ans << endl;
	
	return 0;
}