#include<bits/stdc++.h>
#define MAXN 101
#define INF 2147483647
using namespace std;
char opt[MAXN];
int a[MAXN],b[MAXN],maxdp[MAXN][MAXN],mindp[MAXN][MAXN];
int main(){
	int n;
	scanf("%d",&n);
	for(int i=1;i<=n;++i){
		getchar();
		opt[i]=getchar();
		scanf("%d",&a[i]);
		a[i+n]=a[i];
		opt[i+n]=opt[i];
	}
	for(int i=1;i<=2*n;++i){
		for(int j=i+1;j<=2*n;++j){
			maxdp[i][j]=-INF;
			mindp[i][j]=INF;
		}
	}
	for(int i=1;i<=2*n;++i){
		maxdp[i][i]=mindp[i][i]=a[i];
	}
	for(int s=2;s<=n;++s){
		for(int l=1,r=s;r<=2*n;++l,++r){
			for(int k=l;k<r;++k){
				if(opt[k+1]=='t'){
					maxdp[l][r]=max(maxdp[l][r],maxdp[l][k]+maxdp[k+1][r]);
					mindp[l][r]=min(mindp[l][r],mindp[l][k]+mindp[k+1][r]);
				}else{
					maxdp[l][r]=max(maxdp[l][r],max(maxdp[l][k],mindp[l][k])*max(maxdp[k+1][r],mindp[k+1][r]));
					mindp[l][r]=min(mindp[l][r],min(maxdp[l][k],mindp[l][k])*min(maxdp[k+1][r],mindp[k+1][r]));
				}
			}
		}
	}
	int maxi=maxdp[1][n];
	for(int i=2;i<=n;++i){
		maxi=max(maxi,maxdp[i][i+n-1]);
	}
	printf("%d\n",maxi);
	for(int i=1;i<=n;++i){
		if(maxdp[i][i+n-1]==maxi){
			printf("%d ",i);
		}
	}
	return 0;
}