Problem Description

Bessie and Elsie are plotting to overthrow Farmer John at last! They plan it out over $N$ text messages. Their conversation can be represented by a string $S$ of length $N$ where $S_i$ is either B or E, meaning the $i$-th message was sent by Bessie or Elsie, respectively.

However, Farmer John hears of the plan and attempts to intercept their conversation. Thus, some letters of $S$ are F, meaning Farmer John obfuscated the message and the sender is unknown.

The excitement level of a non-obfuscated conversation is the number of times a cow double-sends—that is, the number of occurrences of substring BB or EE in $S$. You want to find the excitement level of the original message, but you don’t know which of Farmer John’s messages were actually Bessie’s / Elsie’s. Over all possibilities, output all possible excitement levels of $S$.

Input Format

The first line will consist of one integer $N$.

The next line contains $S$.

Output Format

First output $K$, the number of distinct excitement levels possible. On the next $K$ lines, output the excitement levels, in increasing order.

Constraints

$1 \le N \le 2 \times 10^5$.

• Inputs 4-8: $N \le 10$.
• Inputs 9-20: No additional constraints.

Sample Input and Output

Sample Input #1

4
BEEF

Sample Output #1

2
1
2

Sample Input #2

9
FEBFEBFEB

Sample Output #2

2
2
3

Sample Input #3

10
BFFFFFEBFE

Sample Output #3

3
2
4
6

见题面 Input 部分

见题面 Output 部分