#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (1e+18) + 7;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-6;
const ld pi = acos(-1.0);
//typedef vector<vector<ll>> mat;
typedef vector<int> vec;

ll mod_pow(ll a, ll n) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%mod;
		a = a * a%mod; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}


int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };

bool used[50][50][21];
modint memo[50][50][21];

int n;
vector<string> s;
modint dfs(int l, int r, int d) {
	if (l > r)return 1;
	if (used[l][r][d])return memo[l][r][d];
	used[l][r][d] = true;
	modint res = 0;
	Rep1(i, l + 1, r) {
		if (s[i].size() <=d)return memo[l][r][d] = 0;
	}
	if (s[l].size() <= d) {
		return memo[l][r][d] = dfs(l + 1, r, d);
	}
	//cout << l << " " << r <<" "<<d<< endl;
	int len = r - l + 1;
	vector<modint> dp(len + 1, 0);
	dp[0] = 1;
	vector<modint> cop(len + 1);
	rep(i, 26) {
		fill(cop.begin(), cop.end(), 0);
		rep(j, len+1) {
			cop[j] += dp[j];
			Rep(k, j+1, len + 1) {
				if (s[k - 1 + l][d] != '?'&&s[k - 1 + l][d] != 'a' + i)break;
				cop[k] += dp[j] * dfs(j + l, k - 1 + l, d + 1);
			}
		}
		rep(j, len + 1)dp[j] = cop[j];
		//cout << dp[0]<<" "<<dp[len] << endl;
	}
	return memo[l][r][d] = dp[len];
}
void solve() {
	cin >> n; s.resize(n);
	rep(i, n) {
		cin >> s[i];
	}
	modint ans = dfs(0, n - 1, 0);
	cout << ans << endl;
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(12);
	//init_f(); init();
	//int t; cin >> t; rep(i, t)solve();
	solve();
	stop
		return 0;
}



Measured memory_bytes: 20092