1243. Polygon

输入格式

Your program is to read from standard input. The input describes a polygon with $N$ vertices. It contains two lines. On the first line is the number $N$. The second line contains the labels of edges $1,\dots ,N$, interleaved with the vertices’ labels (first that of the vertex between edges $1$ and $2$, then that of the vertex between edges $2$ and $3$, and so on, until that of the vertex between edges $N$ and $1$), all separated by one space. An edge label is either the letter t (representing +) or the letter x (representing *).

$3\le N\le 50$

For any sequence of moves, vertex labels are in the range $[-32768,32767]$.

输出格式

Your program is to write to standard output. On the first line your program must write the highest score one can get for the input polygon. On the second line it must write the list of all edges that, if removed on the first move, can lead to a game with that score. Edges must be written in increasing order, separated by one space.

4
t -7 t 4 x 2 x 5

33
1 2