#include #define rep(i,n) for(int i=0;i<(n);i++) using namespace std; using lint=long long; int main(){ int n,a[16]; scanf("%d",&n); rep(i,n) scanf("%d",&a[i]); vector> L(n); L[0]={a[0]}; rep(i,n-1){ for(lint x:L[i]){ L[i+1].emplace_back(x+a[i+1]); L[i+1].emplace_back(x-a[i+1]); L[i+1].emplace_back(x*a[i+1]); if(a[i+1]!=0) L[i+1].emplace_back(x/a[i+1]); } sort(L[i+1].begin(),L[i+1].end()); L[i+1].erase(unique(L[i+1].begin(),L[i+1].end()),L[i+1].end()); } printf("%lld\n",L[n-1].back()); return 0; }