1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
#include <iostream>
#include <string>
#include <unordered_map>


using namespace std;

using uint = unsigned int;


static constexpr uint DIV = 1000000007;


struct Elem
{
	char m_c;
	int  m_iNextL;
	int  m_iNextP;
	int  m_iCntOfPBelow;

	unordered_map<uint, uint> m_um;
};


static int iStrCnt;

static Elem aElems[1200];

static string aStrs[600];

static uint aResults[600][600];


static int PutFirstStr(const string & s)  // The right string, I mean. It is put as the first one.
{
	int iStrLen = (int) s.size();
	int iStrPos = iStrLen - 1;

	int iNextL = -1;
	int iNextP = -1;
	int iCntOfPBelow = 0;

	for (int i = 0; i < iStrLen; ++i)
	{
		Elem& e = aElems[i];

		e.m_c = s[iStrPos--];

		e.m_iNextL = iNextL;
		e.m_iNextP = iNextP;
		e.m_iCntOfPBelow = iCntOfPBelow;
		e.m_um.clear();

		if (e.m_c == 'L')
		{
			iNextL = i;
		}
		else
		{
			iNextP = i;
			iCntOfPBelow++;
		}
	}

	Elem& FirstElemOfTheNextString = aElems[iStrLen];

	FirstElemOfTheNextString.m_iNextL = iNextL;
	FirstElemOfTheNextString.m_iNextP = iNextP;
	FirstElemOfTheNextString.m_iCntOfPBelow = iCntOfPBelow;

	return iStrLen;
}


static int Put2ndStr(const string& s, int iDst)  // The left string, I mean. It is put as the second one.
{
	int iStrLen = (int) s.size();
	int iStrPos = iStrLen - 1;

	const Elem& e = aElems[iDst];

	int iNextL = e.m_iNextL;
	int iNextP = e.m_iNextP;
	int iCntOfPBelow = e.m_iCntOfPBelow;

	for (int i = 0; i < iStrLen; ++i, ++iDst)
	{
		Elem& e = aElems[iDst];

		e.m_c = s[iStrPos--];

		e.m_iNextL = iNextL;
		e.m_iNextP = iNextP;
		e.m_iCntOfPBelow = iCntOfPBelow;
		e.m_um.clear();

		if (e.m_c == 'L')
		{
			iNextL = iDst;
		}
		else
		{
			iNextP = iDst;
			iCntOfPBelow++;
		}
	}

	return iDst - 1;
}


static uint Recursive(int iPos, int iLs, int iRs)
{
	Elem& e = aElems[iPos];

	uint iHashKey = iLs + (iRs << 11);

	if (e.m_um.count(iHashKey) != 0)
	{
		return e.m_um[iHashKey];
	}

	uint iRes = 0;

	if (e.m_c == 'L')
		iLs++;
	else
		iRs++;

	if (iLs == iRs)
		iRes = 1;

	if (iPos == 0)
	{
		e.m_um[iHashKey] = iRes;
		return iRes;
	}

	// Try to take L, if we can

	if (e.m_iNextL != -1 && aElems[e.m_iNextL].m_iCntOfPBelow > iLs - iRs)
	{
		iRes += Recursive(e.m_iNextL, iLs, iRs);
		iRes %= DIV;
	}

	// Try to take R, if we can

	if (iLs > iRs && e.m_iNextP != -1)
	{
		iRes += Recursive(e.m_iNextP, iLs, iRs);
		iRes %= DIV;
	}

	e.m_um[iHashKey] = iRes;
	return iRes;
}


static uint SolveConcatenation(int iLastPos)
{
	for (int iStartPos = iLastPos; iStartPos > 0; --iStartPos)  // minimal length is 2
	{
		if (aElems[iStartPos].m_c == 'L')
		{
			return Recursive(iStartPos, 0, 0);
		}
	}

	return 0;
}


static void ReadData()
{
	cin >> iStrCnt;

	for (int i = 0; i < iStrCnt; ++i)
	{
		cin >> aStrs[i];
	}
}


static void Solve()
{
	for (int j = 0; j < iStrCnt; ++j)
	{
		int iDst = PutFirstStr(aStrs[j]);

		for (int i = 0; i < iStrCnt; ++i)
		{
			int iLastPos = Put2ndStr(aStrs[i], iDst);

			aResults[i][j] = SolveConcatenation(iLastPos);
		}
	}
}


static void Output()
{
	for (int i = 0; i < iStrCnt; ++i)
	{
		if (i != 0)
			cout << endl;

		for (int j = 0; j < iStrCnt; ++j)
		{
			if (j != 0)
				cout << " ";

			cout << aResults[i][j];
		}
	}
}


int main()
{
	ReadData();

	Solve();

	Output();
}