#include <iostream>

#include <cstdio>

#include <cmath>

#include <algorithm>

#include <vector>

#include <iomanip>

#include <cstring>

#include <map>

#include <queue>

#include <set>

#include <cassert>

#include <stack>

#include <bitset>

#define mkp make_pair

using namespace std;

const double EPS=1e-;

typedef long long lon;

const lon SZ=,INF=0x7FFFFFFF,mod=;

char arr[]={'+','-',' '};

vector<string> res;

int cal(string str)

{

    int pos=;

    pos=str.find_first_of("+-",pos);

    if(pos==-)return ;

    int ope1=,ope2=;

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

    {

        if(str[i]!=' ')

        {

            ope1=ope1*+str[i]-'';

        }

    }

    int oldpos=++pos;

    for(;;)

    {

        pos=str.find_first_of("+-",oldpos);

        if(pos==-)pos=str.size();

        for(int i=oldpos;i<pos;++i)

        {

            if(str[i]!=' ')

            {

                ope2=ope2*+str[i]-'';

            }

        }

        if(str[oldpos-]=='+')ope1=ope1+ope2,ope2=;

        else ope1=ope1-ope2,ope2=;

        oldpos=pos+;

        if(pos==str.size())break;

    }

    return ope1;

}

void dfs(int pos,int n,string &str)

{

    if(pos==n+)

    {

        if(cal(str)==)

        {

            res.push_back(str);

        }

        return;

    }

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

    {

        str+=arr[i];

        str+=pos+'';

        dfs(pos+,n,str);

        str.erase(str.end()-,str.end());

    }

}

int main()

{

    std::ios::sync_with_stdio();

    //freopen("d:\\1.txt","r",stdin);

    lon casenum;

    //cin>>casenum;

    //for(lon time=1;time<=casenum;++time)

    {

        int n;

        cin>>n;

        string str="";

        dfs(,n,str);

        sort(res.begin(),res.end());

        for(int i=;i<res.size();++i)

        {

            cout<<res[i]<<endl;

        }

    }

    return ;

}