#include <bits/stdc++.h>
using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, b, a) for(int i = (b) - 1; i >= (a); 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 add(int a, int b)
{
	return a + b < mod ? a + b : a + b - 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 /= 2;
	}
	return res;
}
int inv(int a)
{
	return binpow(a, mod - 2);	
}

const int N = 200;
int f[N];

const int CNT = 90;
const int LEN = 92;

unordered_map<int, int> hs;
VI hashes[LEN];

VI get(int val)
{
	VI res;
	
	while(true)
	{
		assert(hs.count(val) != 0);
			
		int id = hs[val];
		if(id == -1)
			break;
		res.PB(id);
		val = mult(val, inv(f[id]));
	}
	return res;
}

void solve(int n)
{
	VI lens;
	
	for(auto [val, toL] : hs)
	{
		int nval = mult(n, inv(val));
		
		if(!hs.count(nval))
			continue;
		
		VI L = get(val);
		VI R = get(nval);
		
		lens = L;
		for(int i : R)
			lens.PB(i);
		assert(SZ(lens) != 0);
		if(SZ(lens) == 0)
			continue;
		else
			break;
	}
	FOR(i, 1, 197)
		if(f[i] == n)
			lens = {i};
	
	if(SZ(lens) == 0)
		lens = {0};
	//assert(SZ(lens) != 0);
	//int cur = 1;
	//for(int i : lens)
	//	cur = mult(cur, f[i]);
	//assert(cur == n);
	
	
	FOR(t, 0, 2)
	{
		FOR(i, 0, SZ(lens))
		{
			FOR(j, 0, lens[i])
				cout << ".";
			cout << "#";
		}
		cout << "\n";
	}

}


mt19937 rng(47);

int main()
{
    ios::sync_with_stdio(0); 
    cin.tie(0);
	cout << fixed << setprecision(15);
	f[0] = 1;
	f[1] = 1;
	FOR(i, 2, N)
		f[i] = add(f[i - 1], f[i - 2]);
	
	
	
	hs.reserve(1 << 23);
	hs[1] = -1;
	hashes[0].PB(1);
	FOR(i, 1, CNT)
	{
		FOR(len, 0, LEN)
		{
			if(len + i + 1 >= LEN)
				break;
			for(int val : hashes[len])
			{
				int nval = mult(val, f[i]);
				if(hs.count(nval))
					continue;
				hs[nval] = i;
				hashes[len + i + 1].PB(nval);
			}
		}
		
	}
	FOR(i, CNT, 99)
		hs[f[i]] = i;
	//cerr << SZ(hs) << endl;
	//cerr << 1.0 * clock() / CLOCKS_PER_SEC << endl;
	//return 0;
	
	//FOR(it, 1, 7000)
	//{
	//	int n = rng() % mod;
	//	solve(n);
	//}
	//cerr << 1.0 * clock() / CLOCKS_PER_SEC << endl;
	//return 0;

	
	int n;
	cin >> n;
	
	if(n == 0)
	{
		
		cout << "##.\n";
		cout << ".##\n";
		return 0;
	}
	
	solve(n);
	//assert(n != 0);
	
	
	
	cerr << 1.0 * clock() / CLOCKS_PER_SEC << endl;
	
	
	return 0;
}