// https://contest.ucup.ac/submission/1072091 // https://codeforces.com/contest/1461/submission/100952446 #include using namespace std; typedef long long ll; templatebool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (b=l&&A[R-1]==1) R--; string res; if(L>=R){ for(int i=l;il) res+='+'; } return res; } for(int i=l;i3*(R-L)) break; } if(kake>3*(R-L)){ for(int i=L;iL) res+='*'; } for(int i=R;i X; for(int i=L;i=2) X.push_back(i); } int M=si(X); if(M==1){ res.clear(); for(int i=l;il) res+='+'; } return res; } //cout<<"X"< ma={-1,-1}; for(int bit=0;bit<(1<<(M-1));bit++){ int sum=0; int i=0; while(i>N; for(int i=0;i>A[i]; } string ans; int i=0; while(i=N) break; while(j res={A[0]}; for(int i=0;i