#include<bits/stdc++.h>
using namespace std;
const int N = 210, mod = 1e9 + 7;
int f[N], a[N], val[10000010], n, cnt;
char s[N];
unordered_map<int, int>q;
vector<int>v[10000010];
int inv(int a) {
	int b = mod - 2, ans = 1;
	while(b) {
		if(b & 1)ans = 1ll * ans * a % mod;
		a = 1ll * a * a % mod;
		b >>= 1;
	}
	return ans;
}
void dfs(int x, int las, int mul, int y) {
	if(!q[mul]) {
		q[mul] = ++cnt;
		val[cnt] = mul;
		for(int i = 1; i < x; i++)
			v[cnt].push_back(a[i]);
	} else return;
	for(int i = las; y + i <= 80; i++) {
		a[x] = i;
		dfs(x + 1, i,1ll * mul * f[i] % mod, y + i + 1);
	}
}
int main() {
	f[2] = 2;
	f[3] = 3;
	for(int i = 4; i <= 200; i++)
		f[i] = (f[i - 1] + f[i - 2]) % mod;
	cin >> n;
	dfs(1, 2, 1, 0);
	for(int i = 1; i <= cnt; i++) {
		int t = 1ll * n * inv(val[i]) % mod;
		if(q.find(t) != q.end()) {
			int m = 0;
			for(int j : v[i]) {
				for(int k = 1; k <= j; k++)
					s[++m] = '.';
				s[++m] = '#';
			}
			t = q[t];
			for(int j : v[t]) {
				for(int k = 1; k <= j; k++)
					s[++m] = '.';
				s[++m] = '#';
			}
			if(n == 1) s[1] = '.';
			printf("%s\n%s\n", s + 1, s + 1);
			return 0;
		}
	}
	if(n == 0) {
		puts(".##\n##.");
	}
	return 0;
}