#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int mod = 1e9 + 7;

int mult(int a, int b)
{
	return (LL)a * b % mod;
}
int add(int a, int b)
{
	return a + b < mod ? a + b : a + b - mod;
}
int binpow(int a, int n)
{
	int res = 1;
	while(n)
	{
		if(n & 1)
			res = mult(res, a);
		a = mult(a, a);
		n /= 2;
	}
	return res;
}

const int N = 1 << 20;
int fact[N], ifact[N];
int C(int n, int k)
{
	if(k < 0 || k > n)
		return 0;
	return mult(fact[n], mult(ifact[k], ifact[n - k]));
}
int H(int cnt, int sum)
{
	return C(sum + cnt - 1, sum);
}

void init()
{
	fact[0] = 1;
	FOR(i, 1, N)
		fact[i] = mult(fact[i - 1], i);
	ifact[N - 1] = binpow(fact[N - 1], mod - 2);
	RFOR(i, N, 1)
		ifact[i - 1] = mult(ifact[i], i);
}





int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	init();
	
	int n;
	cin >> n;
	if(n < 3)
	{
		if(n == 1)
		{
			cout << "0" << "\n";
			cout << "0" << "\n";
			cout << "1" << "\n";
			cout << "*" << "\n";
			cout << "0" << "\n";
			cout << "2" << "\n";
		}
		else
		{
			cout << "*0" << "\n";
			cout << "00" << "\n";
			cout << "3" << "\n";
			cout << "*0" << "\n";
			cout << "00" << "\n";
			cout << "4" << "\n";
		}
		return 0;
	}
	cout << string(n - 2, '*') + "0*" << "\n";
	cout << "0" + string(n - 1, '1') << "\n";
	int mxAns = add(1, H(n - 1, n - 1));
	FOR(k, 0, n - 2)
	{
		if(k == 0)
			mxAns = add(mxAns, n + 1);
		else
		{
			FOR(l, 0, n + 1)
			{
				mxAns = add(mxAns, mult(n - l + 1, H(k, l)));
			}
		}
	}
	cout << mxAns << "\n";
	
	
	
	cout << string((n + 1) / 2, '*') + string(n / 2, '0') << "\n";
	cout << string(n, '0') << "\n";
	int k = n / 2;
	int mnAns = k * (k + 3);
	if(n & 1)
		mnAns += k + 2;
	cout << mnAns << "\n";
	
	
	return 0;
}