#include<bits/stdc++.h>
using namespace std;
int n;
struct node{
	char a;
	int b;
}tree[105];
int f[105][105],g[105][105];
int main(){
	memset(g,0x77f,sizeof(g));
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>tree[i].a>>tree[i].b;
		tree[i+n].a=tree[i].a;
		tree[i+n].b=tree[i].b;
		f[i][i]=tree[i].b;
		f[i+n][i+n]=tree[i].b;
		g[i][i]=tree[i].b;
		g[i+n][i+n]=tree[i].b;
	}
	for(int i=2;i<=n;i++){
		for(int j=1;j<=2*n-i+1;j++){
			for(int k=j;k<j+i-1;k++){
				int till=j+i-1;
				if(tree[k+1].a=='t'){
					f[j][till]=max(f[j][k]+f[k+1][till],f[j][till]);
					g[j][till]=min(g[j][k]+g[k+1][till],g[j][till]);
				}
				if(tree[k+1].a=='x'){
					f[j][till]=max(max(f[j][k]*f[k+1][till],f[j][till]),max(g[j][k]*g[k+1][till],max(g[j][k]*f[k+1][till],f[j][k]*g[k+1][till])));
					g[j][till]=min(min(g[j][k]*g[k+1][till],g[j][till]),min(f[j][k]*f[k+1][till],min(g[j][k]*f[k+1][till],f[j][k]*g[k+1][till])));
				}
			}
		}
	}
	int ans=0;
	for(int i=1;i<=n;i++){
		if(ans<f[i][i+n-1]) ans=f[i][i+n-1];
	}
	cout<<ans<<endl;
	for(int i=1;i<=n;i++){
		if(ans==f[i][i+n-1]){
			cout<<i<<" ";
		}
	}
	return 0;
}