// clang-format off
#include <bits/stdc++.h>

using namespace std;

#define ALL(x) (x).begin(), (x).end()

template<class C> void mini(C &a5, C b5) { a5 = min(a5, b5); }
template<class C> void maxi(C &a5, C b5) { a5 = max(a5, b5); }

#ifdef LOCAL
const bool debug = true;
#else
const bool debug = false;
#define cerr if (true) {} else cout
#endif
// clang-format on

#define int long long
#define double long double

const int INF = 1e18;
const int mod = 1e9 + 7;
const int nax = 610;
const int sax = 610;

const int L01 = 1;
const int R01 = 0;
const int L11 = 1;
const int R11 = -1;

int backward[nax][sax];
int fforward[nax][sax];
int arr[nax];

int step[nax][2];

inline int to11(int x) { // {0, 1} -> {-1, 1}
	return x * 2 - 1;
}

inline int to01(int x) { // {-1, 1} -> {0, 1}
	return x > 0;
}

struct My {
	string s;
	int b[2][sax];
	int f_last[2][sax];
	int f_suf[2][sax];
	int partial_result;
	int partial_result2;
	
	My(string s_) : s(s_) {
		clear();
		init_next_arr();
		init_backward();
		init_forward();
		
		// init b
		for (int i = 0; i < 2; i++) {
			for (int sum = 0; sum < sax; sum++) {
				if (i == to01(arr[0])) {
					b[i][sum] = backward[0][sum];
				} else {
					b[i][sum] = backward[ step[0][i] ][sum];
				}
			}
		}
		
		if ('L' == s[0]) {
			partial_result2 = backward[0][0];
		} else {
			partial_result2 = backward[step[0][1]][0];
		}
		
		init_f(0);
		init_f(1);
	}
	
	int solve(const My &other) const {
		int res = this->partial_result;
		
		for (int i = 0; i < 2; i++) {
			for (int sum = 0; sum < sax; sum++) {
				res += this->f_last[i][sum] * other.b[i][sum];
				res += this->f_suf[i][sum] * other.b[1-i][sum];
				res %= mod;
			}
		}
		
		return res;
	}
	
	void init_f(int letter01) {
		int end = (int)this->s.size() - 1;
		while (end >= 0 && !(to01(arr[end]) == letter01)) {
			end--;
		}
		
		if (end < 0) {
			f_last[letter01][0] = 1;
			return;
		}
		
		int begin = end;
		while (begin > 0 && arr[begin-1] == arr[end]) {
			begin--;
		}
		
		for (int sum = 0; sum < sax; sum++) {
			f_last[letter01][sum] = fforward[end][sum];
		}
		if (end != (int)this->s.size() - 1) return;
		for (int sum = 0; sum < sax; sum++) {
			for (int i = begin; i <= end; i++) {
				f_suf[letter01][sum] += fforward[i][sum];
			}
			f_suf[letter01][sum] %= mod;
		}
	}
	
	void clear() {
		for (int i = 0; i < (int)this->s.size() + 5; i++) {
			for (int j = 0; j < sax; j++) {
				backward[i][j] = fforward[i][j] = 0;
			}
			arr[i] = 0;
			step[i][0] = step[i][1] = 0;
		}
		for (int i = 0; i < 2; i++) {
			for (int j = 0; j < sax; j++) {
				b[i][j] = f_last[i][j] = f_suf[i][j] = 0;
			}
		}
	}
	
	void init_next_arr() {
		int size = this->s.size();
		
		step[size-1][0] = size;
		step[size-1][1] = size;
		
		for (int i = 0; i < size; i++) {
			arr[i] = (this->s[i] == 'L') ? 1 : -1;
		}
		
		for (int i = (int)size-2; i >= 0; i--) {
			for (int j = 0; j < 2; j++) {
				step[i][j] = step[i+1][j];
			}
			
			step[i][to01(arr[i+1])] = i+1;
		}
	}
	
	void init_backward() {	
		for (int i = (int)this->s.size()-1; i >= 0; i--) {
			for (int sum = 0; sum < (int)this->s.size()-i+2; sum++) {
				for (int k = 0; k < 2; k++) {
					backward[i][sum] += 
						backward[ step[i][k] ][ sum+arr[i] ];
				}
				
				if (sum == 1 && this->s[i] == 'P') {
					backward[i][sum]++;
				}
				
				backward[i][sum] %= mod;
			}
		}
	}
	
	void init_forward() {
		// init for the first 'L'
		if (arr[0] == L11) {
			fforward[ 0 ][1] = 1; 
		} else {
			fforward[ step[0][L01] ][1] = 1; 
		}
		
		
		for (int i = 0; i < (int)this->s.size()-1; i++) {
			for (int sum = 0; sum < i+2; sum++) {
				for (int k = 0; k < 2; k++) {
					int cur_step = step[i][k];
					int cur_sum = sum + arr[cur_step];
					if (cur_sum < 0) continue;

					int &x = fforward[ cur_step ][ cur_sum ];
					x = (x + fforward[i][sum]) % mod;
				}
			}
		}
		
		this->partial_result = 0;
		for (int i = 0; i < (int)this->s.size(); i++) {
			this->partial_result += fforward[i][0];
			this->partial_result %= mod;
		}
	}
	
	void debug_print() {
		if (!debug) return;
		
		cerr << "debug for " << this->s << "\n";
		cerr << "forward\n";
		for (int i = 0; i < (int)this->s.size(); i++) {
			for (int sum = 0; sum < 10; sum++) {
				cerr << fforward[i][sum] << " ";
			}
			cerr << "\n";
		} 
		
		cerr << "backward\n";
		for (int i = 0; i < (int)this->s.size(); i++) {
			for (int sum = 0; sum < 10; sum++) {
				cerr << backward[i][sum] << " ";
			}
			cerr << "\n";
		} 
	}
};

string dummy(int len=600) {
	string letter = "L";
	if (rand() % 2) letter = "P";
	string res = "";
	for (int i = 0; i < len; i++) {
		res += letter;
	}
	return res;
}

vector<My> v;

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    
    int n=600;
    string s;
    cin >> n;
    for (int i = 1; i <= n; i++) {
		cin >> s;
		//s = dummy();
		v.push_back({s});
		v.back().debug_print();
		cerr << "parital " << i << "\t" << v.back().partial_result << "\n";
		//auto xd = My(s+s);
		//xd.debug_print();
		//cout << xd.partial_result << "\n";
		//cout << xd.partial_result2 << "\n";
		//exit(0);
	}
    
    for (const auto &i : v) {
		for (const auto &j : v) {
			cout << i.solve(j) << " ";
		}
		cout << "\n";
	}
    
    return 0;
}
/*
 * L -> 1; P -> -1
 * */
/*
4
LLPLPP
PPLP
LLP
P
*/