#include<iostream>
using namespace std;

int n , m , f[1000] = {1};

void print(int xx) 
{
	for(int i = 1; i < xx; ++i) 
		cout << f[i] <<"+";
	cout << f[xx] << endl;
}

void dfs(int x) 
{
	for(int i = f[x - 1]; i <= m; ++i) {
		if(i == n) continue;
		f[x] = i; m -= 1;
		if(m == 0) print(x);
		else dfs(x + 1);
		m += 1;
	}
}

int main()
{
	cin >> n;
	m = n;
	dfs(1);
	return 0;
}