#include<stdio.h>
#include<assert.h>

//#define N 7
//#define ALLOWED_CHANGES 1

int X[N][N][N][N][N][N][N][N];
long long cnt = 0;

inline int test_valid(int a,int b,int c,int d,int e,int f,int g,int h)
{
	int i1,i2,i3,i4,i5,i6,i7,i8,i9;
	int scenario=0;
	for(int z=0;z<h;z++)
	{
		if(z == a || z == b || z == c || z == d || z == e || z == f || z == g || z == h) continue;
		if(z<a)
		{
			i1 = z; i2 = a; i3 = b; i4 = c; i5 = d; i6 = e; i7 = f; i8 = g; i9 = h;
			scenario = 1;
		}
		else
		{
			if(z<b)
			{
				i1 = a; i2 = z; i3 = b; i4 = c; i5 = d; i6 = e; i7 = f; i8 = g; i9 = h;
				scenario = 2;
			}
			else 
			{
				if(z<c)
				{
					i1 = a; i2 = b; i3 = z; i4 = c; i5 = d; i6 = e; i7 = f; i8 = g; i9 = h;
					scenario = 3;
				}
				else 
				{
					if(z<d)
					{
						i1 = a; i2 = b; i3 = c; i4 = z; i5 = d; i6 = e; i7 = f; i8 = g; i9 = h;
						scenario = 4;
					}
					else 
					{
						if(z<e)
						{
							i1 = a; i2 = b; i3 = c; i4 = d; i5 = z; i6 = e; i7 = f; i8 = g; i9 = h;
							scenario = 5;
						}
						else 
						{
							if(z<f)
							{
								i1 = a; i2 = b; i3 = c; i4 = d; i5 = e; i6 = z; i7 = f; i8 = g; i9 = h;
								scenario = 6;
							}
							else 
							{
								if(z<g)
								{
									i1 = a; i2 = b; i3 = c; i4 = d; i5 = e; i6 = f; i7 = z; i8 = g; i9 = h;
									scenario = 7;
								}
								else // z<h since h is maximal element
								{
									i1 = a; i2 = b; i3 = c; i4 = d; i5 = e; i6 = f; i7 = g; i8 = z; i9 = h;
									scenario = 8;
								}
							}
						}
					}
				}
			}
		}

		int s1 = X[i1][i2][i3][i4][i5][i6][i7][i8];
		int s2 = X[i1][i2][i3][i4][i5][i6][i7][i9];
		int s3 = X[i1][i2][i3][i4][i5][i6][i8][i9];
		int s4 = X[i1][i2][i3][i4][i5][i7][i8][i9];
		int s5 = X[i1][i2][i3][i4][i6][i7][i8][i9];
		int s6 = X[i1][i2][i3][i5][i6][i7][i8][i9];
		int s7 = X[i1][i2][i4][i5][i6][i7][i8][i9];
		int s8 = X[i1][i3][i4][i5][i6][i7][i8][i9];
		int s9 = X[i2][i3][i4][i5][i6][i7][i8][i9];
		if(s1 == 0 || s2 == 0 || s3 == 0 || s4 == 0 || s5 == 0 || s6 == 0 || s7 == 0 || s8 == 0 || s9 == 0) continue;

		int changes = 0;
		if(s1*s2 < 0) changes++;
		if(s2*s3 < 0) changes++;
		if(s3*s4 < 0) changes++;
		if(s4*s5 < 0) changes++;
		if(s5*s6 < 0) changes++;
		if(s6*s7 < 0) changes++;
		if(s7*s8 < 0) changes++;
		if(s8*s9 < 0) changes++;
		if(changes > ALLOWED_CHANGES) return 0;

	}
	return 1;
}

inline void display()
{
	cnt++;
	printf("#%ld: ",cnt);
	for(int a=0;a<N;a++)
	{
		for(int b=a+1;b<N;b++)
		{
			for(int c=b+1;c<N;c++)
			{
				for(int d=c+1;d<N;d++)
				{
					for(int e=d+1;e<N;e++)
					{
						for(int f=e+1;f<N;f++)
						{
							for(int g=f+1;g<N;g++)
							{
								for(int h=g+1;h<N;h++)
								{
									printf(X[a][b][c][d][e][f][g][h] > 0 ?"+":"-");
								}
							}
						}
					}
				}
			}
		}			
	}
	printf("\n");
}

void rec_fill2(int a,int b,int c,int d,int e,int f, int g, int h)
{
	if(a == b) 
	{
		a = 0;
		b++;
		if(b == c)
		{
			b = 1;
			c++;

			if(c == d)
			{
				c = 2;
				d++;

				if(d == e)
				{
					d = 3;
					e++;

					if(e == f)
					{
						e = 4;
						f++;

						if(f == g)
						{
							f = 5;
							g++;

							if(g == h)
							{
								g = 6;
								h++;
							}
						}
					}
				}
			}
		}
	}

	if(h == N)
	{
		display();
	}
	else
	{
		for(int v=-1;v<=+1;v+=2)
		{
			X[a][b][c][d][e][f][g][h] = v;
			if(test_valid(a,b,c,d,e,f,g,h)) rec_fill2(a+1,b,c,d,e,f,g,h);
			X[a][b][c][d][e][f][g][h] = 0;
		}		
	}
}


void init_zeros()
{
	for(int a=0;a<N;a++)
	{
		for(int b=a+1;b<N;b++)
		{
			for(int c=b+1;c<N;c++)
			{
				for(int d=c+1;d<N;d++)
				{
					for(int e=d+1;e<N;e++)
					{
						for(int f=e+1;f<N;f++)
						{
							for(int g=f+1;g<N;g++)
							{
								for(int h=g+1;h<N;h++)
								{
									X[a][b][c][d][e][f][g][h] = 0;
								}
							}
						}
					}
				}
			}
		}
	}
}

int main()
{
	init_zeros();
	rec_fill2(0,1,2,3,4,5,6,7);
	return 0;
}