#include <cstdio>
#include <cstring>
#define Abs(a) ((a)<0?-(a):(a))

int n;
char path[16];
char fpath[21][16]; int tot;
/*
last 上一个加减号后的值（连起来的也算）
*/
int dfs( int i, int last, int sum ) {
	if( i==n+1 ) {
		if( sum==0 ) {
			if( tot<20 ) {
				tot++;
				memcpy( fpath[tot], path, sizeof(path) );
			}
			return 1;
		}
		return 0;
	}
	int r=0;
	path[i] = '+';
	r += dfs( i+1, +i, sum+i );
	path[i] = '-';
	r += dfs( i+1, -i, sum-i );
	if( Abs(last)>=123456789 ) return r;
	path[i] = '.';
	int now=last*(i>=10?100:10)+i*(last<0?-1:1);
	r += dfs( i+1, now, sum-last+now );
	return r;
}
int main() {
	int r;
	scanf( "%d", &n );
	r = dfs( 2, 1, 1 );
	for( int t=1; t<=tot; t++ ) {
		printf( "1" );
		for( int i=2; i<=n; i++ ) 
			printf( " %c %d", fpath[t][i], i );
		printf( "\n" );
	}
	printf( "%d\n", r );
}