#include <bits/stdc++.h>
using namespace std;
long long  maxx[105][105],minn[105][105],ans=-1e9;
long long a[105],y[105],n;
vector<int> v;
int main(){
	scanf("%d",&n);
	char t;
	for(int i=1;i<=n;i++){
		cin>>t>>a[i];
		if(t=='x') y[i]=1,y[i+n]=1; 
		else y[i]=2,y[i+n]=2;
		a[i+n]=a[i];
		maxx[i][i]=a[i];
		minn[i][i]=a[i];
		maxx[i+n][i+n]=maxx[i][i];
		minn[i+n][i+n]=minn[i][i];
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j+i-1<=2*n;j++){
			int r=j+i-1;
			for(int k=j;k<r;k++){
				if(y[k+1]==1){
					minn[j][r]=min(minn[j][k]*minn[k+1][r],minn[j][r]);
					minn[j][r]=min(maxx[j][k]*minn[k+1][r],minn[j][r]);
					minn[j][r]=min(minn[j][k]*maxx[k+1][r],minn[j][r]);
					minn[j][r]=min(maxx[j][k]*maxx[k+1][r],minn[j][r]);
					maxx[j][r]=max(minn[j][k]*minn[k+1][r],maxx[j][r]);
					maxx[j][r]=max(maxx[j][k]*minn[k+1][r],maxx[j][r]);
					maxx[j][r]=max(minn[j][k]*maxx[k+1][r],maxx[j][r]);
					maxx[j][r]=max(maxx[j][k]*maxx[k+1][r],maxx[j][r]);
				}else if(y[k+1]==2){
					minn[j][r]=min(minn[j][k]+minn[k+1][r],minn[j][r]);
					maxx[j][r]=max(maxx[j][k]+maxx[k+1][r],maxx[j][r]);
				}
			}
		}
	}
	for(int i=1;i<=n;i++){
		if(maxx[i][i+n-1]==ans){
			v.push_back(i);
		}else if(maxx[i][i+n-1]>ans){
			v.clear();
            ans=maxx[i][i+n-1];
			v.push_back(i);
		}
	}
	printf("%d\n",ans);
	for(int i=0;i<v.size();i++) printf("%d ",v[i]);
	return 0;
}

#3 #4