#include <bits/stdc++.h>
#define int long long
#define N 101
using namespace std;
int n, f[N][N][2], Max;
char c[N];
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    cin >> n;
    for (int i = 1; i <= 100; ++i)
        for (int j = 1; j <= 100; ++j)
            f[i][j][0] = 1e9;
    for (int i = 1; i <= 2 * n; ++i)
    {
        if (i & 1)
            cin >> c[(i + 1) / 2];
        else
            cin >> f[i / 2][i / 2][0], f[i / 2][i / 2][1] = f[i / 2][i / 2][0];
    }
    for (int i = 1; i <= n; ++i)
    {
        c[i + n] = c[i], f[i + n][i + n][1] = f[i + n][i + n][0] = f[i][i][0];
    }
    for (int len = 1; len <= n; ++len)
        for (int l = 1; l + len - 1 <= 2 * n; ++l)
        {
            int r = l + len - 1;
            for (int k = l; k < r; ++k)
            {
                if (c[k + 1] == 't')
                    f[l][r][1] = max(f[l][r][1],
                                     f[l][k][1] + f[k + 1][r][1]),
                    f[l][r][0] = min(f[l][r][0],
                                     f[l][k][0] + f[k + 1][r][0]);
                else
                    f[l][r][1] = max(f[l][r][1],
                                     max(max(f[l][k][1] * f[k + 1][r][1],
                                             f[l][k][0] * f[k + 1][r][0]),
                                         max(f[l][k][1] * f[k + 1][r][0],
                                             f[l][k][0] * f[k + 1][r][1]))),
                    f[l][r][0] = min(f[l][r][0],
                                     min(min(f[l][k][1] * f[k + 1][r][1],
                                             f[l][k][0] * f[k + 1][r][0]),
                                         min(f[l][k][1] * f[k + 1][r][0],
                                             f[l][k][0] * f[k + 1][r][1])));
            }
        }
    for (int i = 1; i <= n; ++i)
        Max = max(Max, f[i][i + n - 1][1]);
    cout << Max << '\n';
    for (int i = 1; i <= n; ++i)
        if (f[i][i + n - 1][1] == Max)
            cout << i << ' ';
    cout << '\n';
    return 0;
}