#include<iostream>
#include<cstdio>
#define N 1001
#define mod 1000000007
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int MD(int x)
{
	return x>=mod?x-mod:x;
}
void Adder(int &x,int d)
{
	x=x+d>=mod?x+d-mod:x+d;
	return;
}
int n,res,dp[N+1][N+1];
int main()
{
	n=read();
	if (n==1)
	{
		puts("*");
		puts("0");
		puts("1");
	}
	else if (n==2)
	{
		puts("*0");
		puts("00");
		puts("3");
	}
	else
	{
		for (int i=1;i<=n;++i) printf(i==n-1?"0":"*");
		puts("");
		for (int i=1;i<=n;++i) printf(i==1?"0":"1");
		puts("");
		for (int i=2;i<=n+1;++i) dp[1][i]=1+(i==n+1);
		for (int i=2;i<=n-1;++i)
			for (int j=1;j<=n+1;++j)
				dp[i][j]=MD(MD(dp[i-1][j]+dp[i][j-1])+1);
		printf("%d\n",dp[n-1][n+1]);
	}
	for (int i=1;i<=n;++i) printf(i<=(n>>1)+1?"*":"0");
	puts("");
	for (int i=1;i<=n;++i) printf("0");
	puts("");
	for (int i=1;i<=n;++i) res+=((i+3)>>1);
	printf("%d\n",res);
	return 0;
}