#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 = 1'000'000'007;
const int MAGIC = 1 << 17;

mt19937 rng;

void updAdd(int& x, int val)
{
	x += val;
	if (x >= mod)
		x -= mod;
}

void updSub(int& x, int val)
{
	x -= val;
	if (x < 0)
		x += mod;
}

int mult(int a, int b)
{
	return (LL)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 >>= 1;
	}
	return res;
}

int f(const vector<string>& s)
{
	assert(SZ(s[0]) == SZ(s[1]));
	vector dp(2, VI(2));
	dp[1][1] = 1;
	FOR(i, 0, SZ(s[0]))
	{
		vector ndp(2, VI(2));
		FOR(j, 0, 2)
			FOR(k, 0, 2)
			{
				int cur = dp[j][k];
				bool b0 = s[0][i] == '#', b1 = s[1][i] == '#';
				if (!b0 && !b1 && j && k)
					updAdd(ndp[1][1], cur);
				int p0 = j ^ 1, p1 = k ^ 1;
				if ((p0 && b0) || (p1 && b1))
					continue;
				updAdd(ndp[b0 || p0][b1 || p1], cur);
			}
		dp = ndp;
	}
	return dp[1][1];
}

int rand(int a, int b)
{
	return a + rng() % (b - a);
}

vector<string> randomVector()
{
	int n = 2 * rand(30, 50);
	vector<string> vec(2, string(n, '.'));
	for (string& s : vec)
	{
		int k = rand(3, 7);
		FOR(i, 0, k)
		{
			int j = rand(0, n - 1);
			if (s[j] == '.' && s[j + 1] == '.')
				s[j] = s[j + 1] = '#';
		}
	}
	return vec;
}

vector<string> prk1[MAGIC];
unordered_map<int, int> mp;

int main()
{
	ios::sync_with_stdio(0); 
	cin.tie(0);
	int n;
	cin >> n;
	if (n == 0)
	{
		cout << "##.\n.##\n";
		return 0;
	}
	int cnt0 = 0;
	FOR(i, 0, MAGIC)
	{
		prk1[i] = randomVector();
		int c = f(prk1[i]);
		if (c != 0)
			mp[c] = i;
		else
			cnt0++;
	}
	cerr << SZ(mp) << " " << MAGIC << "\n";
	while (true)
	{
		vector<string> prk2 = randomVector();
		int c = f(prk2);
		if (c == 0)
			continue;
		int d = mult(n, binpow(c, mod - 2));
		if (mp.count(d))
		{
			vector<string> ans(2);
			int i = mp[d];
			FOR(j, 0, 2)
			{
				ans[j] = prk1[i][j] + "#" + prk2[j];
				cout << ans[j] << "\n";
			}
			cerr << (db)clock() / CLOCKS_PER_SEC << endl;
			assert(f(ans) == n);
			return 0;
		}
	}	
	return 0;
}