/*

TASK:zerosum

LANG:C++

*/

#include<cstdio>

#include<string>

#include<algorithm>

using namespace std;

#define N 15

int n;

int k[N],cnt,s[]={,,-};

string ans[];

void dfs(int d){

    if(d>n){

        int sum=,c=;

        for(int i=;i<=n;i++){

            if(k[i]){

                sum+=c;

                c=i*k[i];

            }else{

                c=c*+(c>?i:-i);

            }

        }

        sum+=c;

        if(sum==){

            ans[++cnt]+="";

            for(int i=;i<=n;i++){

                ans[cnt]+=k[i]>?'+':k[i]<?'-':' ';

                ans[cnt]+=i+'';

            }

        }

        return;

    }

    for(int i=;i<=;i++){

        k[d]=s[i];

        dfs(d+);

    }

}

int main(){

    freopen("zerosum.in","r",stdin);

    freopen("zerosum.out","w",stdout);

    scanf("%d",&n);

    dfs();

    for(int i=;i<=cnt;i++){

        printf("%s\n",ans[i].c_str());

    }

}