#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>

using namespace std;

#define REP(i,n)	for(int i=0;i<(n);++i)
#define REPS(i,s,t)	for(int i=(s);i<(t);++i)

#define INF 		2000000007
#define MINF		-200000007
#define MOD			1048576 	
// 2^20

#define MAX 		1000005

typedef unsigned int 			uint;
typedef unsigned long long int	ull;
typedef long long int 			ll;

//int dp[MAX];

int N;
vector<int> a(16);

ll bfs(ll sum,int n){
	if(n-1==N){
		return max(sum+a[n],max(sum-a[n],sum*a[n]));
	}
	else
		return max(bfs(sum+a[n],n+1),max(bfs(sum-a[n],n+1),bfs(sum*a[n],n+1)));
}

int main(){
	cin>>N;
	REP(i,N)cin>>a[i];

	cout << bfs(0LL,0) << endl;

	return 0;
}