CF67A.Partial Teacher

A teacher decides to give toffees to his students. He asks n students to stand in a queue. Since the teacher is very partial, he follows the following rule to distribute toffees.

He looks at the first two students and gives more toffees to the student having higher marks than the other one. If they have the same marks they get the same number of toffees. The same procedure is followed for each pair of adjacent students starting from the first one to the last one.

It is given that each student receives at least one toffee. You have to find the number of toffees given to each student by the teacher such that the total number of toffees is minimum.

一位老师决定给学生分发糖果。他让 $n$ 名学生排成一队。由于这位老师非常偏心，他按照以下规则分发糖果：

他先观察前两名学生，并将更多的糖果分给分数更高的那名学生；如果这两名学生的分数相同，则他们获得相同数量的糖果。接着，他以同样的方式依次比较每一对相邻的学生，即从第 1 名和第 2 名开始，一直到第 $n-1$ 名和第 $n$ 名。

已知每名学生至少获得一颗糖果。你需要求出老师分给每名学生的糖果数量，使得糖果总数最少。

The first line of input contains the number of students n (2 ≤ n ≤ 1000). The second line gives (n - 1) characters consisting of "L", "R" and "=". For each pair of adjacent students "L" means that the left student has higher marks, "R" means that the right student has higher marks and "=" means that both have equal marks.

输入的第一行包含学生人数 $n$（$2 \leq n \leq 1000$）。第二行给出 $(n - 1)$ 个字符，每个字符为 "L"、"R" 或 "="。对于每一对相邻的学生，"L" 表示左侧学生分数更高，"R" 表示右侧学生分数更高，"=" 表示两人分数相等。

Output consists of n integers separated by a space representing the number of toffees each student receives in the queue starting from the first one to the last one.

输出包含 n 个整数，以空格分隔，表示队列中每个学生（从第一个到最后一个）所获得的糖果数量。